On ranking 1-way finitely ambiguous NL languages and -complete census functions
A. Bertoni, M. Goldwurm (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata”
On ranking 1-way finitely ambiguous NL languages and -complete census functions
Some remarks on multihead automata
I. H. Sudborough (1977)
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:
Complexity classes between and
J. Castro, C. Seara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I Ko (1990)
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:
Complexity arguments in algebraic language theory
Helmut Alt, Kurt Mehlhorn (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: