The following pages link to Real time computation (Q2526723):
Displaying 39 items.
- On the power of several queues (Q685436) (← links)
- On the power of real-time two-way multihead finite automata with jumps (Q794171) (← links)
- On two-tape real-time computation and queues (Q801685) (← links)
- Milking the Aanderaa argument (Q918198) (← links)
- Complexity lower bounds for machine computing models (Q1057651) (← links)
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← 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)
- Complexity of algorithms and computations (Q1153141) (← links)
- An information-theoretic approach to time bounds for on-line computation (Q1156484) (← links)
- The halting problem for linear Turing assemblers (Q1231906) (← links)
- Recognition of a self-crossing of a plane trajectory by a Kolmogorov algorithm (Q1245938) (← links)
- Palindrome recognition in real time by a multitape Turing machine (Q1249574) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- Undecidability and chaos in word-coded symbolic dynamics (Q1346778) (← links)
- On the simulation of many storage heads by one (Q1348528) (← links)
- Monitoring hyperproperties with circuits (Q2165208) (← links)
- A theoretical analysis of the effects of amygdalectomy and of organismi motivation (Q2531775) (← links)
- Über einen Automaten mit Pufferspeicherung (Q2537131) (← links)
- Time-restricted sequence generation (Q2537897) (← links)
- Complexity problems in real time languages (Q2547547) (← links)
- On non-determinacy in simple computing devices (Q2550291) (← links)
- Tape-reversal bounded Turing machine computations (Q2560051) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines (Q3748273) (← links)
- COMBING NILPOTENT AND POLYCYCLIC GROUPS (Q4513294) (← links)
- WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM (Q4786246) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
- On the Computational Complexity of Algorithms (Q5339741) (← links)
- The theory of languages (Q5551468) (← links)
- Counter machines and counter languages (Q5551469) (← links)
- On the Minimum Computation Time of Functions (Q5582354) (← links)
- (Q5586400) (← links)
- The theory of languages (Q5592247) (← links)
- A note on dense and nondense families of complexity classes (Q5619822) (← links)
- Computational complexity of random access stored program machines (Q5627619) (← links)
- (Q5682256) (← links)
