Pages that link to "Item:Q2922024"
From MaRDI portal
The following pages link to Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata (Q2922024):
Displayed 8 items.
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- Improved complement for two-way alternating automata (Q2675811) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)