Lower space bounds for accepting shuffle languages
Andrzej Szepietowski (1999)
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 “Complexity arguments in algebraic language theory”
Lower space bounds for accepting shuffle languages
Space classes, intersection of languages and bounded erasing homomorphisms
Andreas Brandstädt (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Pumping and pushdown machines
Kai Salomaa, D. Wood, Sheng Yu (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on the recognition of one counter languages
S. A. Greibach (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Some remarks on multihead automata
I. H. Sudborough (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Algebraic caractérisations of NTIME and NTIME
Hans-Jürgen Stenger (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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: