Finiteness results on rewriting systems
Jean-Claude Raoult (1981)
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 “On subdirectly irreducible automata”
Finiteness results on rewriting systems
Saturating right congruences
Bertrand Le Saec (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Computing the prefix of an automaton
Marie-Pierre Béal, Olivier Carton (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Efficient reductions of picture words
Franz J. Brandenburg, Jürgen Dassow (1993)
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 the structure of general stochastic automata
Hans Daduna (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On parallel deletions applied to a word
Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: