An automatic semigroup of languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Automatic completely-simple semigroups
- Automatic groups and amalgams
- Automatic monoids and change of generators
- Automatic semigroups
- Automaticity and commutative semigroups
- Self-automaton semigroups.
Cited in
(15)- Language classes associated with automata over matrix groups
- Automaticity and commutative semigroups
- scientific article; zbMATH DE number 7720791 (Why is no real title available?)
- CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
- A note on finitely generated semigroups of regular languages.
- scientific article; zbMATH DE number 3913692 (Why is no real title available?)
- scientific article; zbMATH DE number 1529076 (Why is no real title available?)
- Automatic semigroup acts.
- scientific article; zbMATH DE number 18280 (Why is no real title available?)
- 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)