On free inverse monoid languages
Pedro V. Silva (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Pedro V. Silva (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Pedro V. Silva (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups)....
Olivier Carton, Christian Choffrut, Serge Grigorieff (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we investigate the following decision problem: given a relation in one of the families, does it belong to a smaller family? We settle the problem entirely when all monoids have a unique generator and fill some gaps in the general case. In particular, adapting a proof of Stearns, we show that it is recursively decidable whether...
Alain Terlutte, David Simplot (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Laurent Pierre, Jean-Marc Farinone (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Paavo Turakainen (1982)
Banach Center Publications
Similarity: