Efficient simplicity testing of automata

DOI10.1016/0304-3975(92)90352-GzbMath0761.68066OpenAlexW2058822420MaRDI QIDQ1193902

Shuhua Zhang

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90352-g

zbMATH Keywords

pseudovariety of finite semigroupsstreams of regular languages

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Regular solutions of language inequalities and well quasi-orders

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

This page was built for publication: Efficient simplicity testing of automata