Pages that link to "Item:Q2550291"
From MaRDI portal
The following pages link to On non-determinacy in simple computing devices (Q2550291):
Displayed 48 items.
- Logarithmic space and permutations (Q276248) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- The complexity of debate checking (Q493647) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Cyclic automata (Q1100919) (← links)
- Multiprocessor automata (Q1108012) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- A new complete language for DSPACE(log n) (Q1123607) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Three-way two-dimensional multicounter automata (Q1143796) (← 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)
- Marker automata (Q1231894) (← links)
- Relating refined space complexity classes (Q1235980) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- Some undecidable problems for parallel communicating finite automata systems (Q1603408) (← links)
- Amplification of slight probabilistic advantage at absolutely no cost in space (Q1607005) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Tight hierarchy of data-independent multi-head automata (Q2194865) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- A note on multihead automata and context-sensitive languages (Q2558753) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata (Q2695283) (← links)
- Finite dP Automata versus Multi-head Finite Automata (Q2890286) (← links)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983) (← links)
- One-Way Reversible Multi-head Finite Automata (Q3453731) (← links)
- On two-way weak counter machines (Q3766856) (← links)
- Relativization of questions about log space computability (Q4109299) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- Some results concerning automata on two-dimensional tapes (Q4132439) (← links)
- (Q4146255) (← links)
- Rudimentary relations and stack languages (Q4147594) (← links)
- PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS (Q4528767) (← links)
- (Q4580325) (← links)
- Computing on structures (Q4630296) (← links)
- (Q4993339) (← links)
- Properties of probabilistic pushdown automata (Q5055907) (← links)
- The equivalence of pebbles and sensing heads for finite automata (Q5055952) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- Primitive recursion in the abstract (Q5220181) (← links)
- Diving into the queue (Q5223609) (← links)
- Returning and non-returning parallel communicating finite automata are equivalent (Q5441543) (← links)
- Ramified Corecurrence and Logspace (Q5739361) (← links)