Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space

DOI10.1016/0020-0190(89)90158-0zbMath0684.68062OpenAlexW2061378925MaRDI QIDQ1825656

Andrzej Szepietowski

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90158-0

zbMATH Keywords

Turing machinenondeterminismcomplementspace complexityalternating hierarchy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items

A hierarchy that does not collapse : alternations in low level space ⋮ A survey of space complexity ⋮ Sublogarithmic $\sum _2$-space is not closed under complement and other separation results

Cites Work

• If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n
• Erratum to: Some observations concerning alternating Turing machines using small space
• The method of forced enumeration for nondeterministic automata
• Remarks on languages acceptable in log log n space
• Halting space-bounded computations
• Space bounds for processing contentless inputs
• On tape bounds for single letter alphabet language processing
• Nondeterministic Space is Closed under Complementation
• Alternation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item