scientific article; zbMATH DE number 1502111
From MaRDI portal
Publication:4503152
Recommendations
- Unary Languages Recognized by Two-Way One-Counter Automata
- Simulations of unary one-way multi-head finite automata
- Two-way automaton computations
- Two-Way Non-Uniform Finite Automata
- Two-way non-uniform finite automata
- scientific article; zbMATH DE number 1848284
- Optimal simulations between unary automata
- Converting two-way nondeterministic unary automata into simpler automata.
- Finite automata and unary languages
- Simulation of two-way pushdown automata revisited
Cited in
(33)- Finite automata and unary languages
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations
- Converting two-way nondeterministic unary automata into simpler automata.
- On the descriptional power of heads, counters, and pebbles
- Complementing unary nondeterministic automata
- Removing nondeterminism in constant height pushdown automata
- Complementing two-way finite automata
- Optimal simulations between unary automata
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Investigations on Automata and Languages over a Unary Alphabet
- Unary Languages Recognized by Two-Way One-Counter Automata
- Two-Way Unary Automata versus Logarithmic Space
- Deterministic Pushdown Automata and Unary Languages
- Nondeterministic state complexity of star-free languages
- scientific article; zbMATH DE number 1848284 (Why is no real title available?)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- scientific article; zbMATH DE number 2106352 (Why is no real title available?)
- Two-way finite automata: old and recent results
- Quantum finite automata: advances on Bertoni's ideas
- Limited automata and regular languages
- Two-way unary automata versus logarithmic space
- Investigations on automata and languages over a unary alphabet
- Two-way finite automata: old and recent results
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata
- 1-limited automata: witness languages and techniques
- Limited automata and unary languages
- Descriptional complexity of iterated uniform finite-state transducers
- scientific article; zbMATH DE number 7770052 (Why is no real title available?)
- Iterated uniform finite-state transducers on unary languages
- Two-Way Non-Uniform Finite Automata
- Two-way machines and de Bruijn words
- Iterated uniform finite-state transducers on unary languages
- Two-way non-uniform finite automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503152)
