Pages that link to "Item:Q2643079"
From MaRDI portal
The following pages link to Complementing two-way finite automata (Q2643079):
Displaying 29 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← 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)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Two-way automata characterizations of L/poly versus NL (Q2354593) (← links)
- Improved complement for two-way alternating automata (Q2675811) (← links)
- State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- On the Size Complexity of Rotating and Sweeping Automata (Q3533032) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ (Q5495414) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)
- Linear-time limited automata (Q5919709) (← 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)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)
