BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS

DOI10.1142/S012905410500308XzbMath1097.68056OpenAlexW2002392781MaRDI QIDQ5462116

Thomas Paranthoën, Jean-Marc Champarnaud, Fabien Coulon

Publication date: 1 August 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410500308x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• THE ABSTRACT THEORY OF AUTOMATA
• Compact and fast algorithms for safe regular expression search
• Subset construction complexity for homogeneous automata, position automata and ZPC-structures

This page was built for publication: BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS