Complexity of E0L structural equivalence
Kai Salomaa, Derick Wood, Sheng Yu (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Decidability of equivalence for a class of non-deterministic tree transducers”
Complexity of E0L structural equivalence
First-order properties of trees, star-free expressions, and aperiodicity
Uschi Heuter (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Systolic tree acceptors
Karel Ii Culik, Arto Salomaa, Derick Wood (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A syntactic characterization of bounded-rank decision trees in terms of decision lists
Nicola Galesi (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the average number of registers needed to evaluate a special class of backtrack trees
U. Trier (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On frontiers of regular trees
Wolfgang Thomas (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: