Magic Numbers and Ternary Alphabet
From MaRDI portal
Publication:3637234
DOI10.1007/978-3-642-02737-6_24zbMath1247.68144OpenAlexW1599628433MaRDI QIDQ3637234
Publication date: 7 July 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_24
Related Items
Concatenation of regular languages and descriptional complexity ⋮ State Complexity of Projected Languages
Cites Work
- A lower bound technique for the size of nondeterministic finite automata
- Partial orders on words, minimal elements of regular languages, and state complexity
- Finite automata and unary languages
- Intersection and union of regular languages and state complexity
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- Magic Numbers in the State Hierarchy of Finite Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item