On the number of active states in finite automata

DOI10.1007/S00236-021-00397-8OpenAlexW3186009139MaRDI QIDQ2041683

Henning Bordihn, Markus Holzer

Publication date: 23 July 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-021-00397-8

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Erratum to: ``A three-restricted normal form theorem for ETOL languages
• 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
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
• A study in parallel rewriting systems

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