Pages that link to "Item:Q2550291"
From MaRDI portal
The following pages link to On non-determinacy in simple computing devices (Q2550291):
Displayed 28 items.
- 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)
- A note on multihead automata and context-sensitive languages (Q2558753) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983) (← 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)
- Returning and non-returning parallel communicating finite automata are equivalent (Q5441543) (← links)