Some theorems on graph congruences
Robert Knast (1983)
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.
Displaying similar documents to “Graph congruences and pair testing”
Some theorems on graph congruences
The pseudovariety is hyperdecidable
J. Almeida, M. Zeitoun (1997)
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:
Decomposing a -valued transducer into unambiguous ones
Andreas Weber (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
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:
Finiteness results on rewriting systems
Jean-Claude Raoult (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: