An extension of the notions of traces and of asynchronous automata
A. Arnold (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Finiteness results on rewriting systems”
An extension of the notions of traces and of asynchronous automata
Saturating right congruences
Bertrand Le Saec (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Coordinated pair systems ; part I : Dyck works and classical pumping
A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Closure properties of certain families of formal languages with respect to a generalization of cyclic closure
Andreas Brandstadt (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A fast algorithm to decide on the equivalence of stateless DPDA
Didier Caucal (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On ambiguity in DOS systems
Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decidable subcases of the equivalence problem for recursive program schemes
Bruno Courcelle, Jean H. Gallier (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: