The following pages link to (Q4503152):
Displaying 28 items.
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
- Two-way non-uniform finite automata (Q832933) (← links)
- Finite automata and unary languages (Q1099644) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- Optimal simulations between unary automata (Q2719119) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- Investigations on Automata and Languages over a Unary Alphabet (Q3192250) (← links)
- Unary Languages Recognized by Two-Way One-Counter Automata (Q3192259) (← links)
- Two-Way Unary Automata versus Logarithmic Space (Q3584893) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
- LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- (Q5867525) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
- (Q6070604) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- Two-Way Non-Uniform Finite Automata (Q6169962) (← links)
