scientific article; zbMATH DE number 1502111
From MaRDI portal
Publication:4503152
zbMATH Open0965.68043MaRDI QIDQ4503152FDOQ4503152
Authors: Carlo Mereghetti, Giovanni Pighizzini 
Publication date: 4 September 2000
Title of this publication is not available (Why is that?)
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)
- Iterated uniform finite-state transducers on unary languages
- Title not available (Why is that?)
- Deterministic Pushdown Automata and Unary Languages
- Descriptional complexity of iterated uniform finite-state transducers
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata
- Limited automata and unary languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nondeterministic state complexity of star-free languages
- Complementing two-way finite automata
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- Iterated uniform finite-state transducers on unary languages
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Investigations on automata and languages over a unary alphabet
- Two-way machines and de Bruijn words
- Converting two-way nondeterministic unary automata into simpler automata.
- Removing nondeterminism in constant height pushdown automata
- Two-way unary automata versus logarithmic space
- Complementing unary nondeterministic automata
- Two-way non-uniform finite automata
- Optimal simulations between unary automata
- Two-Way Non-Uniform Finite Automata
- On the descriptional power of heads, counters, and pebbles
- Unary Languages Recognized by Two-Way One-Counter Automata
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations
- Title not available (Why is that?)
- Investigations on Automata and Languages over a Unary Alphabet
- Two-Way Unary Automata versus Logarithmic Space
- Limited automata and regular languages
- Two-way finite automata: old and recent results
- Two-way finite automata: old and recent results
- Quantum finite automata: advances on Bertoni's ideas
- Finite automata and unary languages
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)
