A hierarchy that does not collapse : alternations in low level space
Viliam Geffert (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Sublogarithmic -space is not closed under complement and other separation results”
A hierarchy that does not collapse : alternations in low level space
A space lower bound for acceptance by one-way -alternating machines
Viliam Geffert, Norbert Popély (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Some modifications of auxiliary pushdown automata
G. Buntrock, F. Drewes, C. Lautemann, T. Mossakowski (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Two-way multihead automata over a one-letter alphabet
Burkhard Monien (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Relationships among , , and the determinant
Eric Allender, Mitsunori Ogihara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on NSPACE () and substitution
S. A. Greibach (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
Birgit Jenner, Bernd Kirsig (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: