You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Leicester » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Leicester

Return to search Previous output Next output

Output 15 of 71 in the submission

Article title

Automatic presentations for semigroups

Type

D - Journal article

DOI

10.1016/j.ic.2009.02.005

Title of journal

Information and Computation

Article number

Volume number

207

Issue number

First page of article

1156

ISSN of journal

0890-5401

Year of publication

2009

URL

http://dx.doi.org/10.1016/j.ic.2009.02.005

Number of additional authors

Additional information

<10>Since the introduction by Khoussainov and Nerode in 1995 of the notion of a structure being FA-presentable there has been a great deal of interest in determining which structures have this property. This paper contains a complete classification of all FA-presentable finitely-generated cancellative semigroups, thereby generalizing the result for groups in STACS 2005. This is one of the very few complete classifications of FA-presentable structures; as a consequence, subsequent research on FA-presentable semigroups has focused on the non-cancellative case. This paper appears in the LATA2008 "best papers" special issue.

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract