Binary coded unary regular languages
From MaRDI portal
Publication:6199860
DOI10.1007/978-3-031-40247-0_1OpenAlexW4385705369MaRDI QIDQ6199860
Publication date: 28 February 2024
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the state complexity of reversals of regular languages
- Finite automata and unary languages
- Bits and relative order from residues, space efficiently
- An optimal lower bound for nonregular languages
- Space hierarchy theorem revised.
- State complexity of binary coded regular languages
- Magic numbers in the state hierarchy of finite automata
- Optimal Simulations between Unary Automata
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- Fast Parallel Arithmetic via Modular Representation
- Chrobak Normal Form Revisited, with Applications
- Factoring and testing primes in small space
- Two Families of Languages Related to ALGOL
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\)
This page was built for publication: Binary coded unary regular languages
