The following pages link to On two-way multihead automata (Q2559145):
Displaying 47 items.
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Deterministic two-way one-head pushdown automata are very powerful (Q800088) (← links)
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- A new complete language for DSPACE(log n) (Q1123607) (← links)
- Halting space-bounded computations (Q1134515) (← links)
- Time complexity of languages recognized by one-way multihead pushdown automata (Q1158973) (← links)
- Fooling a two way automaton or one pushdown store is better than one counter for two way machines (Q1165027) (← links)
- On tape-bounded complexity classes and multihead finite automata (Q1215271) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Relating refined space complexity classes (Q1235980) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Stack languages and log n space (Q1250712) (← links)
- Some undecidable problems for parallel communicating finite automata systems (Q1603408) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
- Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities (Q2800414) (← links)
- UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909096) (← links)
- ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909225) (← links)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983) (← links)
- Two-dimensional finite automata and unacceptable functions (Q3051389) (← links)
- A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata (Q3637229) (← links)
- Gradually intractable problems and nondeterministic log-space lower bounds (Q3700836) (← links)
- (Q3885190) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- (Q4131691) (← links)
- Some results concerning automata on two-dimensional tapes (Q4132439) (← links)
- (Q4146255) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS (Q4528767) (← links)
- (Q4769049) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- New results concerning synchronized finite automata (Q5204312) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Binding-blocking automata (Q5416433) (← links)
- Returning and non-returning parallel communicating finite automata are equivalent (Q5441543) (← links)
- NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES (Q5704375) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies (Q6114832) (← links)
