Algebraic caractérisations of NTIME and NTIME
Hans-Jürgen Stenger (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On the robustness of ALMOST-”
Algebraic caractérisations of NTIME and NTIME
Space classes, intersection of languages and bounded erasing homomorphisms
Andreas Brandstädt (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A pumping theorem for deterministic ETOL languages
A. Ehrenfeucht, G. Rozenberg (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On languages satisfying Ogden's lemma
L. Boasson, S. Horváth (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The family of languages satisfying Bar-Hillel's lemma
Sándor Horváth (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The independence of certain operations on semiAFLs
Ronald V. Book, Sheila A. Greibach (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
There is no complete axiom system for shuffle expressions
A. Szepietowski (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: