Converting binary automata to unary automata
From MaRDI portal
Cites work
- Binary coded unary regular languages
- Complementing two-way finite automata
- Efficient determination of the transitive closure of a directed graph
- Finite automata and unary languages
- scientific article; zbMATH DE number 1178976 (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?)
- Magic numbers in the state hierarchy of finite automata
- Nondeterminism and the size of two way finite automata
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the state complexity of reversals of regular languages
- Optimal simulations between unary automata
- Relationships between nondeterministic and deterministic tape complexities
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- 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: Converting binary automata to unary automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894346)
