Pages that link to "Item:Q5638291"
From MaRDI portal
The following pages link to One-tape, off-line Turing machine computations (Q5638291):
Displaying 50 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Some remarks about the ''efficiency'' of polyautomata (Q594595) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- On the power of several queues (Q685436) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines (Q808247) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- The difference between one tape and two tapes: With respect to reversal complexity (Q920983) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Complexity lower bounds for machine computing models (Q1057651) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- On pebble automata (Q1088408) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- Data encodings and their costs (Q1139942) (← links)
- On alternation (Q1141480) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines with output tape (Q1208717) (← links)
- The halting problem for linear Turing assemblers (Q1231906) (← links)
- On the sequential nature of functions (Q1232180) (← links)
- Parallel turing machines with one-head control units and cellular automata (Q1285791) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- An optimal lower bound for nonregular languages (Q1330656) (← links)
- New lower bounds for element distinctness on a one-tape Turing machine (Q1336768) (← links)
- Deterministic multitape automata computations (Q1393939) (← links)
- Palindrome recognition using a multidimensional tape. (Q1401342) (← links)
- Bounds for the Element Distinctness Problem on one-tape Turing machines (Q1603524) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- The speed of copying on one-tape off-line turing machines (Q1824387) (← links)
- Deterministic Turing machines in the range between real-time and linear-time. (Q1853527) (← links)
- Verifying whether one-tape Turing machines run in linear time (Q2009635) (← links)
- Undecidability of the speed positiveness problem in reversible and complete Turing machines (Q2040026) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Multitape one-way nonwriting automata (Q2527943) (← links)
- k-Band-Simulation von k-Kopf-Turing-Maschinen. (k-tape simulation of k- head Turing machines) (Q2547545) (← links)
- Time-bounded grammars and their languages (Q2548174) (← links)
- On the extension of Gladkij's theorem and the hierarchies of languages (Q2557560) (← links)
- A time lower bound for satisfiability (Q2581273) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- A Hierarchy of Fast Reversible Turing Machines (Q2822488) (← links)
- Reversible Limited Automata (Q2945882) (← links)
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA (Q3069734) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
