Pages that link to "Item:Q5200094"
From MaRDI portal
The following pages link to State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094):
Displaying 5 items.
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
