Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1157.20332
Cain, Alan J.; Oliver, Graham; Ruškuc, Nik; Thomas, Richard M.
Automatic presentations for cancellative semigroups. (English)
[A] Mart{\'\i}n-Vide, Carlos (ed.) et al., Language and automata theory and applications. Second international conference, LATA 2008, Tarragona, Spain, March 13--19, 2008. Revised papers. Berlin: Springer. Lecture Notes in Computer Science 5196, 149-159 (2008). ISBN 978-3-540-88281-7/pbk

Summary: This paper studies FA-presentable structures and gives a complete classification of the finitely generated FA-presentable cancellative semigroups. We show that a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually Abelian group.

MSC 2000:: *20M05 Free semigroups
20M35 Semigroups in automata theory, linguistics, etc.
68Q45 Formal languages

Keywords: finitely generated cancellative semigroups; finitely presented semigroups; automatic presentations

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.
	Elementary number theory. Primes, congruences, and secrets.

Simple Search

Zentralblatt MATH Berlin [Germany]