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

DOI10.1007/978-3-319-60134-2_4MaRDI QIDQ2399248zbMATH OpenOpenAlexFDO

Authors Henning Bordihn, Markus Holzer

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)

Recommendations

• On the number of active states in finite automata
• State complexity of regular languages
• scientific article; zbMATH DE number 2201359
• On the number of accepting states of finite automata
• Automaticity. I: Properties of a measure of descriptional complexity

Cites work

• A study in parallel rewriting systems
• A three-restricted normal form theorem for ETOL languages
• scientific article; zbMATH DE number 1747441 (Why is no real title available?)
• Intersection and union of regular languages and state complexity
• Multiple-entry finite automata
• Symbolic model checking: \(10^{20}\) states and beyond

Cited in

(4)

• On the number of active states in finite automata
• scientific article; zbMATH DE number 1502109 (Why is no real title available?)
• Magic Numbers in the State Hierarchy of Finite Automata
• Lower bound for the number of states of purposeful deterministic automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399248)