On the number of active states in deterministic and nondeterministic finite automata

DOI10.1007/978-3-319-60134-2_4zbMath1489.68121OpenAlexW2619559442MaRDI QIDQ2399248

Markus Holzer, Henning Bordihn

Publication date: 22 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• A three-restricted normal form theorem for ETOL languages
• Symbolic model checking: \(10^{20}\) states and beyond
• Intersection and union of regular languages and state complexity
• Multiple-entry finite automata
• A study in parallel rewriting systems

This page was built for publication: On the number of active states in deterministic and nondeterministic finite automata