Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space
From MaRDI portal
Publication:2817388
DOI10.1007/978-3-662-53132-7_16zbMath1359.68095OpenAlexW2482194616MaRDI QIDQ2817388
Publication date: 30 August 2016
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_16
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A speed-up theorem without tape compression
- A tradeoff theorem for space and reversal
- The method of forced enumeration for nondeterministic automata
- Halting space-bounded computations
- Space bounded computations: Review and new separation results
- Bridging across the \(\log(n)\) space frontier
- The alternation hierarchy for sublogarithmic space is infinite
- Turing machines with sublogarithmic space
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE
- Nondeterministic Space is Closed under Complementation
- Alternation
- ${\text{ASPACE}}(o(\log \log n))$ is Regular
- A hierarchy that does not collapse : alternations in low level space
- The Sublogarithmic Alternating Space World
- UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(log log n)
- One-tape, off-line Turing machine computations
This page was built for publication: Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space
