Optimal simulations between unary automata
From MaRDI portal
Recommendations
- On simulation cost of unary limited automata
- Simulations of unary one-way multi-head finite automata
- scientific article; zbMATH DE number 1502111
- scientific article; zbMATH DE number 1747446
- Optimal simulation of self-verifying automata by deterministic automata
- OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA
- Deterministic automata. Simulation, universality and minimality
- scientific article; zbMATH DE number 2063252
- scientific article; zbMATH DE number 2201363
- Finite nondeterministic automata: simulation and minimality
Cited in
(60)- Finite automata and unary languages
- Converting two-way nondeterministic unary automata into simpler automata.
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
- Descriptional complexity of limited automata
- On the descriptional power of heads, counters, and pebbles
- Complementing unary nondeterministic automata
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- The descriptional power of queue automata of constant length
- Descriptional complexity of regular languages
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets
- State complexity of GF(2)-operations on unary languages
- On the transformation of two-way deterministic finite automata to unambiguous finite automata
- Removing nondeterminism in constant height pushdown automata
- Oblivious two-way finite automata: decidability and complexity
- Pairs of complementary unary languages with ``balanced nondeterministic automata
- Magic numbers in the state hierarchy of finite automata
- A space lower bound for acceptance by one-way _2-alternating machines
- In memoriam Chandra Kintala
- Complexity of promise problems on classical and quantum automata
- From two-way to one-way finite automata -- three regular expression-based methods
- Translation from classical two-way automata to pebble two-way automata
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Descriptional complexity of input-driven pushdown automata
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE
- Hyper-minimizing minimized deterministic finite state automata
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Deterministic Pushdown Automata and Unary Languages
- Descriptional and Computational Complexity of Finite Automata
- Unambiguous finite automata over a unary alphabet
- Nondeterministic state complexity of star-free languages
- An alternating hierarchy for finite automata
- State complexity of operations on two-way finite automata over a unary alphabet
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- scientific article; zbMATH DE number 1502111 (Why is no real title available?)
- scientific article; zbMATH DE number 1747446 (Why is no real title available?)
- On the state complexity of operations on two-way finite automata
- Simulations of unary one-way multi-head finite automata
- Limited automata and regular languages
- On simulation cost of unary limited automata
- Descriptional and computational complexity of finite automata -- a survey
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Investigations on automata and languages over a unary alphabet
- Pushdown automata and constant height: decidability and bounds
- Iterated uniform finite-state transducers on unary languages
- On the transformation of two-way finite automata to unambiguous finite automata
- Binary coded unary regular languages
- Push complexity: optimal bounds and decidability
- Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata
- Nondeterminism makes unary 1-limited automata concise
- On the transformation of two-way nondeterministic finite automata to unambiguous finite automata
- Converting binary automata to unary automata
- Complexity of unary exclusive nondeterministic finite automata
- Forgetting 1-limited automata
- Latvian quantum finite state automata for unary languages
- Binary coded unary regular languages
- Cellular automata: communication matters
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets
- Iterated uniform finite-state transducers on unary languages
This page was built for publication: Optimal simulations between unary automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719119)
