منابع مشابه
Walking automata in the free inverse monoid
In this paper, we study languages of birooted trees or, following Scheiblich-Munn’s theorem, subsets of free inverse monoids. Extending the classical notion of rational languages with a projection operator that maps every set of birooted trees to the subset of its idempotent elements it is first shown that the hierarchy induced by the nesting depth of that projection operator simply correspond ...
متن کاملMonoid Automata for Displacement Context-Free Languages
In 2007 Kambites presented an algebraic interpretation of Chomsky-Schützenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well-nested multiple context-free languages. We also obtain a characterization of kdisplacement context-free languages in terms of monoid automata a...
متن کاملOn periodic points of free inverse monoid endomorphisms
It is proved that the periodic point submonoid of a free inverse monoid endomorphism is always finitely generated. Using Chomsky’s hierarchy of languages, we prove that the fixed point submonoid of an endomorphism of a free inverse monoid can be represented by a context-sensitive language but, in general, it cannot be represented by a context-free language.
متن کاملWord Problem Languages for Free Inverse Monoids
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...
متن کاملInverse Monoids, Trees, and Context-Free Languages
This paper is concerned with a study of inverse monoids presented by a set X subject to relations of the form ei = fi, i E I , where ei and fi are Dyck words, i.e. idempotents of the free inverse monoid on X. Some general results of Stephen are used to reduce the word problem for such a presentation to the membership problem for a certain subtree of the Cayley graph of the free group on X. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1996
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1996300403491