ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
From MaRDI portal
Publication:3538856
DOI10.1142/S0129054108005887zbMath1155.68048MaRDI QIDQ3538856
Publication date: 24 November 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bideterministic automata and minimal representations of regular languages
- On viewing block codes as finite automata.
- On the average state and transition complexity of finite languages
- Star height of certain families of regular events
- Minimal NFA Problems are Hard
- The loop complexity of pure-group events
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON