Pages that link to "Item:Q3100939"
From MaRDI portal
The following pages link to State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata (Q3100939):
Displaying 8 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)
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- Performing regular operations with 1-limited automata (Q6580078) (← links)