Pages that link to "Item:Q3533031"
From MaRDI portal
The following pages link to On the State Complexity of Operations on Two-Way Finite Automata (Q3533031):
Displaying 9 items.
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)