Bideterministic automata and minimal representations of regular languages
From MaRDI portal
Publication:703504
DOI10.1016/j.tcs.2004.07.010zbMath1071.68052MaRDI QIDQ703504
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.010
68Q45: Formal languages and automata
Related Items
Bideterministic weighted automata, Bideterministic weighted automata, Quotients and atoms of reversible languages, Nondeterministic syntactic complexity, Identification of birfsa languages., ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA, Minimal NFA and biRFSA Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On viewing block codes as finite automata.
- Bideterministic Automata and Minimal Representations of Regular Languages
- Minimal trellises for block codes
- Inference of Reversible Languages
- Minimal NFA Problems are Hard
- On the State Minimization of Nondeterministic Finite Automata