On the structure of finitely generated semigroups of unary regular languages

DOI10.1142/S0129054110007507MaRDI QIDQ3056271zbMATH OpenFDO

Authors Sergey Afonin, Elena Khazova

Publication date 11 November 2010

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

zbMATH Keywords

rationalautomaticmonoidregular languagesKleenefinitely generated subsemigroupsone letter alphabet

Mathematics Subject Classification ID

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

Recommendations

• A note on finitely generated semigroups of regular languages.
• The problem on automaticity of semigroups of regular languages.
• A note on automatic semigroups.
• An automatic semigroup of languages
• On the semigroup languages and the regular languages

Cites work

• scientific article; zbMATH DE number 3902926 (Why is no real title available?)
• Automatic completely-simple semigroups
• Automatic semigroups
• Automaticity and commutative semigroups
• Easy multiplications. I: The realm of Kleene's theorem
• MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
• Representation theorems on regular languages

Cited in

(10)

• scientific article; zbMATH DE number 7720791 (Why is no real title available?)
• A note on finitely generated semigroups of regular languages.
• The problem on automaticity of semigroups of regular languages.
• scientific article; zbMATH DE number 1944132 (Why is no real title available?)
• Finitely generated semigroups having presentation with regular congruence classes.
• Remarks concerning finitely generated semigroups having regular sets of unique normal forms
• Recognizing pro-\(\mathrm{R}\) closures of regular languages
• Automata and rational expressions
• On the semigroup languages and the regular languages
• Notes on finitely generated semigroups and pumping conditions for regular languages

This page was built for publication: On the structure of finitely generated semigroups of unary regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056271)