Pages that link to "Item:Q5199977"
From MaRDI portal
The following pages link to Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (Q5199977):
Displaying 19 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 unambiguous input-driven pushdown automata (Q484313) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
- State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
- Periodic properties of pushdown automata (Q2288436) (← links)
- Two-way automata characterizations of L/poly versus NL (Q2354593) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
- On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)
