Algebraic caractérisations of NTIME and NTIME
Hans-Jürgen Stenger (1984)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “There is no complete axiom system for shuffle expressions”
Algebraic caractérisations of NTIME and NTIME
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:
On languages satisfying Ogden's lemma
L. Boasson, S. Horváth (1978)
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 “interchange Lemma”
Victor Mitrana (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Comparison of basic language generating devices (non-deterministic systems)
Manfred Kudlek (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The strong independence of substitution and homomorphic replication
S. A. Greibach (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: