Decidability of equivalence for a class of non-deterministic tree transducers
Yves André, Max Dauchet (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On semigroups of matrices over the tropical semiring”
Decidability of equivalence for a class of non-deterministic tree transducers
Uniformly growing backtrack trees
Rainer Kemp (1995)
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:
Digital search trees with keys of variable length
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Complexity of E0L structural equivalence
Kai Salomaa, Derick Wood, Sheng Yu (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Continuous monoids and yields of infinite trees
M. Dauchet, E. Timmerman (1986)
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: