Pages that link to "Item:Q1338452"
From MaRDI portal
The following pages link to Turing machines with sublogarithmic space (Q1338452):
Displayed 39 items.
- Weak and strong one-way space complexity classes (Q293473) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- A note on alternating one-pebble Turing machines with sublogarithmic space (Q844190) (← links)
- Fooling Turing machines with sublogarithmic space: a note on `For completeness, sublogarithmic space is no space' by M. Agrawal (Q963359) (← links)
- A communication hierarchy of parallel computations (Q1129258) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- On space functions fully constructed by two-dimensional Turing machines (Q1349721) (← links)
- A remark on middle space bounded alternating Turing machines (Q1350303) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- A variant of inductive counting (Q1566745) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines (Q1818780) (← links)
- A note on two-dimensional probabilistic Turing machines (Q1818955) (← links)
- Non-closure property of space-bounded two-dimensional alternating Turing machines (Q1857029) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Uncountable realtime probabilistic classes (Q2400994) (← links)
- Some properties of one-pebble Turing machines with sublogarithmic space (Q2566005) (← 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)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- Factoring and Testing Primes in Small Space (Q3599080) (← links)
- Lower Space Bounds for Accepting Shuffle Languages (Q4718896) (← links)
- Some results concerning two-dimensional turing machines and finite automata (Q5055911) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← links)
- Membership Problem for Two-Dimensional General Row Jumping Finite Automata (Q5859631) (← links)
- A note on one-pebble two-dimensional Turing machines (Q5894928) (← links)
- A note on one-pebble two-dimensional Turing machines (Q5899349) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5919539) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5920059) (← links)
- Alternation for sublogarithmic space-bounded alternating pushdown automata (Q5941289) (← links)