Binary coded unary regular languages
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 3269886 (Why is no real title available?)
- scientific article; zbMATH DE number 3305070 (Why is no real title available?)
- An optimal lower bound for nonregular languages
- Binary coded unary regular languages
- Bits and relative order from residues, space efficiently
- Chrobak normal form revisited, with applications
- Factoring and testing primes in small space
- Fast Parallel Arithmetic via Modular Representation
- Finite automata and unary languages
- Magic numbers in the state hierarchy of finite automata
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the accepting state complexity of operations on permutation automata
- On the accepting state complexity of operations on permutation automata
- On the state complexity of reversals of regular languages
- Optimal simulations between unary automata
- Space hierarchy theorem revised.
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- State complexity of binary coded regular languages
- Two Families of Languages Related to ALGOL
- Unary coded NP-complete languages in \(\mathrm{ASpace}(\log \log n)\)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\)
This page was built for publication: Binary coded unary regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989496)
