Efficient simplicity testing of automata
From MaRDI portal
Publication:1193902
DOI10.1016/0304-3975(92)90352-GzbMath0761.68066MaRDI QIDQ1193902
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Cites Work
- Characterization of idempotent transformation monoids
- On the varieties of completely regular semigroups
- The amalgamation of automata
- On the computational power of pushdown automata
- Complexity of some problems from the theory of automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item