ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES
From MaRDI portal
Publication:3056271
DOI10.1142/S0129054110007507zbMath1207.68179MaRDI QIDQ3056271
Publication date: 11 November 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
regular languages; rational; monoid; automatic; Kleene; finitely generated subsemigroups; one letter alphabet
68Q45: Formal languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
Cites Work