Pages that link to "Item:Q3978779"
From MaRDI portal
The following pages link to Nondeterministic Computations in Sublogarithmic Space and Space Constructibility (Q3978779):
Displayed 21 items.
- Weak and strong one-way space complexity classes (Q293473) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- A communication hierarchy of parallel computations (Q1129258) (← links)
- A relationship between nondeterministic turing machines and 1-inkdot turing machines with small space (Q1199887) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- On 1-inkdot alternating Turing machines with small space (Q1325841) (← links)
- A note on multi-inkdot nondeterministic Turing machines with small space (Q1334629) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- A Space Lower Bound for Acceptance by One-Way Π<sub>2</sub>-Alternating Machines (Q2720409) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- Factoring and Testing Primes in Small Space (Q3599080) (← links)
- A hierarchy that does not collapse : alternations in low level space (Q4365021) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← 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)