Magic Numbers and Ternary Alphabet
From MaRDI portal
Recommendations
Cites work
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- A lower bound technique for the size of nondeterministic finite automata
- Finite automata and unary languages
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 1834665 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3305070 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- Magic Numbers in the State Hierarchy of Finite Automata
- Nonterminal complexity of some operations on context-free languages
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- Partial orders on words, minimal elements of regular languages, and state complexity
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
Cited in
(5)
This page was built for publication: Magic Numbers and Ternary Alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637234)