Pages that link to "Item:Q616495"
From MaRDI portal
The following pages link to Complexity of multi-head finite automata: origins and directions (Q616495):
Displaying 30 items.
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Head and state hierarchies for unary multi-head finite automata (Q478518) (← links)
- Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
- Refined simulation of multihead automata (Q1339383) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- Prediction of infinite words with automata (Q1635815) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q2164756) (← links)
- Tight hierarchy of data-independent multi-head automata (Q2194865) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Finite dP Automata versus Multi-head Finite Automata (Q2890286) (← links)
- Automata with Modulo Counters and Nondeterministic Counter Bounds (Q2914726) (← links)
- A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA (Q3126017) (← links)
- A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads (Q3453732) (← links)
- Frugal Encoding in Reversible $\mathcal{MOQA}$ : A Case Study for Quicksort (Q3453737) (← links)
- Some characterizations of multihead finite automata (Q3716303) (← links)
- (Q4699306) (← links)
- From Nondeterministic to Multi-Head Deterministic Finite-State Transducers (Q5092329) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- Diving into the queue (Q5223609) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES (Q5247180) (← links)
- (Q5416362) (← links)
- P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA (Q5495416) (← links)
- INSIDE THE CLASS OF REGEX LANGUAGES (Q5495423) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q6077068) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
