Pages that link to "Item:Q1312177"
From MaRDI portal
The following pages link to The alternation hierarchy for sublogarithmic space is infinite (Q1312177):
Displayed 16 items.
- An alternating hierarchy for finite automata (Q442279) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Fooling Turing machines with sublogarithmic space: a note on `For completeness, sublogarithmic space is no space' by M. Agrawal (Q963359) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- A variant of inductive counting (Q1566745) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- Some properties of one-pebble Turing machines with sublogarithmic space (Q2566005) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- A hierarchy that does not collapse : alternations in low level space (Q4365021) (← links)
- Inductive counting below logspace (Q5096885) (← links)
- CLOSURE PROPERTY OF PROBABILISTIC TURING MACHINES AND ALTERNATING TURING MACHINES WITH SUBLOGARITHMIC SPACES (Q5249267) (← links)
- A note on one-pebble two-dimensional Turing machines (Q5894928) (← links)
- A note on one-pebble two-dimensional Turing machines (Q5899349) (← links)
- Alternation for sublogarithmic space-bounded alternating pushdown automata (Q5941289) (← links)