The following pages link to (Q4077448):
Displaying 16 items.
- On the power of several queues (Q685436) (← links)
- On heads versus tapes (Q792093) (← links)
- On two-tape real-time computation and queues (Q801685) (← links)
- Milking the Aanderaa argument (Q918198) (← links)
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- Alternating real-time computations (Q1111386) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- An information-theoretic approach to time bounds for on-line computation (Q1156484) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- \(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs (Q1201728) (← links)
- On the simulation of many storage heads by one (Q1348528) (← links)
- Realtime subshifts (Q1566732) (← links)
- Possibilities of various types of alternating automata (Q3787476) (← links)
- Deterministic realization of nondeterministic computations with a low measure of nondeterminism (Q4007372) (← links)
- Real-time computations with restricted nondeterminism (Q4197340) (← links)
