Minimal NFA and biRFSA Languages

DOI10.1051/ita:2008022zbMath1166.68025OpenAlexW2108280515MaRDI QIDQ3625690

Alain Terlutte, Michel Latteux, Yves Roos

Publication date: 6 May 2009

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2009__43_2_221_0/

zbMATH Keywords

residual finite state automataminimal NFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Nondeterministic syntactic complexity ⋮ Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited ⋮ Identification of birfsa languages. ⋮ Minimal NFA and biRFSA Languages ⋮ Descriptional complexity of regular languages

Cites Work

• Bideterministic automata and minimal representations of regular languages
• NFA reduction algorithms by means of regular inequalities
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Identification of birfsa languages.
• Minimal NFA and biRFSA Languages
• Inference of Reversible Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal NFA and biRFSA Languages