Pages that link to "Item:Q1134515"
From MaRDI portal
The following pages link to Halting space-bounded computations (Q1134515):
Displaying 50 items.
- Weak and strong one-way space complexity classes (Q293473) (← links)
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Walking on data words (Q504989) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- On pebble automata (Q1088408) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- Some observations concerning alternating Turing machines using small space (Q1097697) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- On space functions constructed by two-dimensional Turing machines (Q1186366) (← links)
- A survey of space complexity (Q1193412) (← links)
- Some remarks on two-dimensional finite automata (Q1193834) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- The alternation hierarchy for sublogarithmic space is infinite (Q1312177) (← links)
- Notes on looping deterministic two-way pushdown automata (Q1318758) (← links)
- Computational complexity of functions (Q1351510) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- Reversible space equals deterministic space (Q1567403) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- Some notes on strong and weak log log n space complexity (Q1824397) (← links)
- Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space (Q1825656) (← links)
- Characterization of realizable space complexities (Q1892934) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Degrees of restriction for two-dimensional automata (Q2117665) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← 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)
- A Survey on Picture-Walking Automata (Q3098039) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
- A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads (Q3453732) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (Q3811712) (← links)
- New decidability results concerning two-way counter machines and applications (Q4630270) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- Inequalities for space-bounded Kolmogorov complexity (Q5061387) (← links)
- If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n (Q5096159) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)
