THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES
From MaRDI portal
Publication:2909186
DOI10.1142/S0129054112400084zbMath1280.68109arXiv1008.1653OpenAlexW2963305382MaRDI QIDQ2909186
Markus Holzer, Sebastian Jakobi, Martin Kutrib
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.1653
Related Items (7)
Networks of evolutionary processors: the power of subregular filters ⋮ Magic Numbers in Periodic Sequences ⋮ On a structural property in the state complexity of projected regular languages ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ State Complexity of Projected Languages ⋮ The Complexity of Languages Resulting from the Concatenation Operation ⋮ State Complexity of Prefix Distance of Subregular Languages
Cites Work
- A lower bound technique for the size of nondeterministic finite automata
- State complexity of basic operations on suffix-free regular languages
- On NFAs where all states are final, initial, or both
- 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
- Determination of finite automata accepting subregular languages
- Magic numbers in the state hierarchy of finite automata
- MAGIC NUMBERS AND TERNARY ALPHABET
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Deterministic blow-ups of minimal NFA's
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Power-separating regular languages
- Roots of Star Events
This page was built for publication: THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES
