scientific article; zbMATH DE number 1949657
From MaRDI portal
Publication:4412581
Recommendations
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- scientific article; zbMATH DE number 1372650
- scientific article; zbMATH DE number 1834665
- On finite automata with limited nondeterminism (extended abstract)
- The complexity of probabilistic versus deterministic finite automata
Cited in
(20)- On finite automata with limited nondeterminism
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- The size of power automata.
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- VC-dimensions of nondeterministic finite automata for words of equal length
- Square on deterministic, alternating, and Boolean finite automata
- scientific article; zbMATH DE number 3876601 (Why is no real title available?)
- Some estimations for finite automata identification
- scientific article; zbMATH DE number 4080912 (Why is no real title available?)
- scientific article; zbMATH DE number 1948503 (Why is no real title available?)
- scientific article; zbMATH DE number 2040919 (Why is no real title available?)
- scientific article; zbMATH DE number 1834685 (Why is no real title available?)
- On the size complexity of deterministic frequency automata
- On finite automata with limited nondeterminism (extended abstract)
- Square on Deterministic, Alternating, and Boolean Finite Automata
- An upper bound for transforming self-verifying automata into deterministic ones
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
- Subset construction complexity for homogeneous automata, position automata and ZPC-structures
- On deterministic finite automata and syntactic monoid size
- On the size of Boyer-Moore automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412581)
