An automatic semigroup of languages
DOI10.1007/S00200-016-0306-7zbMATH Open1370.20062OpenAlexW2546792751MaRDI QIDQ2363384FDOQ2363384
Authors: Hossein Doostie, Bozorg Panbehkar 
Publication date: 19 July 2017
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-016-0306-7
Recommendations
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automatic semigroups
- Automatic monoids and change of generators
- Automatic groups and amalgams
- Automatic completely-simple semigroups
- Self-automaton semigroups.
- Automaticity and commutative semigroups
Cited In (15)
- Language classes associated with automata over matrix groups
- Title not available (Why is that?)
- Automaticity and commutative semigroups
- CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
- A note on finitely generated semigroups of regular languages.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automatic semigroup acts.
- Title not available (Why is that?)
- Automatic Rees matrix semigroups over categories.
- The problem on automaticity of semigroups of regular languages.
- On the structure of finitely generated semigroups of unary regular languages
- A note on automatic semigroups.
- On the semigroup languages and the regular languages
- Fundamentals of Computation Theory
This page was built for publication: An automatic semigroup of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363384)
