Characterizations of the Dyck sets
Celia Wrathall (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On free inverse monoid languages”
Characterizations of the Dyck sets
Hierarchies of aperiodic languages
Janusz A. Brzozowski (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Free group languages : rational versus recognizable
Pedro V. Silva (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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)....
Pumping and pushdown machines
Kai Salomaa, D. Wood, Sheng Yu (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Languages obtained from infinite words
T. Harju, L. Ilie (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On simple representations of language families
K. Culik II, H. A. Maurer (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The strong independence of substitution and homomorphic replication
S. A. Greibach (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: