On the structure of finitely generated semigroups of unary regular languages
From MaRDI portal
Publication:3056271
DOI10.1142/S0129054110007507zbMATH Open1207.68179MaRDI QIDQ3056271FDOQ3056271
Authors: Sergey Afonin, Elena Khazova 
Publication date: 11 November 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Automatic semigroups
- Representation theorems on regular languages
- Easy multiplications. I: The realm of Kleene's theorem
- Automatic completely-simple semigroups
- Automaticity and commutative semigroups
- MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
Cited In (10)
- Title not available (Why is that?)
- A note on finitely generated semigroups of regular languages.
- The problem on automaticity of semigroups of regular languages.
- Title not available (Why is that?)
- 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)
