Pages that link to "Item:Q443746"
From MaRDI portal
The following pages link to State complexity of operations on two-way finite automata over a unary alphabet (Q443746):
Displaying 15 items.
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata (Q3100939) (← links)
- Two-Way Unary Automata versus Logarithmic Space (Q3584893) (← links)
- (Q4565598) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
