Pages that link to "Item:Q5638291"
From MaRDI portal
The following pages link to One-tape, off-line Turing machine computations (Q5638291):
Displayed 24 items.
- Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines (Q3748273) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- New time hierarchy results for deterministic TMS (Q5096792) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
- Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences (Q5200101) (← links)
- Automata with cyclic move operations for picture languages (Q5223618) (← links)
- Two-dimensional Sgraffito automata (Q5248876) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
- RESTARTING TILING AUTOMATA (Q5401561) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- (Q5571697) (← links)
- On the Minimum Computation Time of Functions (Q5582354) (← links)
- (Q5586400) (← links)
- Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung (Q5587565) (← links)
- Computational complexity of random access stored program machines (Q5627619) (← links)
- On restricted turing computability (Q5632561) (← links)
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage (Q5637881) (← links)
- (Q5867524) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Weight-reducing Turing machines (Q6040666) (← links)
- (Q6070604) (← links)