Bideterministic automata and minimal representations of regular languages

DOI10.1016/j.tcs.2004.07.010zbMath1071.68052OpenAlexW2169734852MaRDI QIDQ703504

Hellis Tamm, Esko Ukkonen

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

zbMATH Keywords

Bideterministic automataMinimal automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Quotients and atoms of reversible languages ⋮ Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA ⋮ Nondeterministic syntactic complexity ⋮ Identification of birfsa languages. ⋮ 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

This page was built for publication: Bideterministic automata and minimal representations of regular languages