Output details
11 - Computer Science and Informatics
University of Leicester
Article title
Automatic presentations and semigroup constructions
Type
D - Journal article
Title of journal
Theory of Computing Systems
Article number
-
Volume number
47
Issue number
2
First page of article
568
ISSN of journal
1432-4350
Year of publication
2010
URL
Number of additional authors
3
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. The class of general semigroups presents a particular challenge and there appears to be no prospect of a general classification at the moment. The results in this paper give a comprehensive account of the interaction between FA-presentability and semigroup constructions and are used in further work on "Unary FA-presentable semigroups" (by Cain et al) and on "Automatic Clifford semigroups" (by Cain).
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
