ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES

DOI10.1142/S0129054110007507zbMath1207.68179MaRDI QIDQ3056271

Elena Khazova, Sergey Afonin

Publication date: 11 November 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

regular languagesrationalmonoidautomaticKleenefinitely generated subsemigroupsone letter alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

Automata and rational expressions

Cites Work

• Unnamed Item
• Representation theorems on regular languages
• Easy multiplications. I: The realm of Kleene's theorem
• Automatic semigroups
• Automatic completely-simple semigroups
• Automaticity and commutative semigroups
• MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

This page was built for publication: ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES