ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON

DOI10.1142/S0129054105003790zbMath1105.68060OpenAlexW2047110092MaRDI QIDQ5714672

Jean-Marc Champarnaud, Fabien Coulon

Publication date: 15 December 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/s0129054105003790

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A geometrical view of the determinization and minimization of finite-state automata
• Minimal NFA Problems are Hard
• On the State Minimization of Nondeterministic Finite Automata

This page was built for publication: ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON