Complexity arguments in algebraic language theory
Helmut Alt, Kurt Mehlhorn (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On computations with integer division”
Complexity arguments in algebraic language theory
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:
Strong iterative pairs and the regularity of context-free languages
A. Ehrenfeucht, G. Rozenberg (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
FPOL systems generating counting languages
A. Ehrenfeucht, G. Rozenberg (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Ogden's lemma for nonterminal bounded languages
R. Boonyavatana, G. Slutzki (1986)
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:
Yield-languages recognized by alternating tree recognizers
Kai Salomaa (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: