Mathematics – Rings and Algebras
Scientific paper
2007-10-19
Mathematics
Rings and Algebras
15 pages
Scientific paper
We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or more, such automata accept exactly the context-free languages. For the polycyclic monoid of rank 1 (that is, the bicyclic monoid), they accept a class of languages strictly including the partially blind one-counter languages. Key to the proof is a description of the rational subsets of polycyclic and bicyclic monoids, other consequences of which include the decidability of the rational subset membership problem for these monoids, and the closure of the class of rational subsets under intersection and complement.
Kambites Mark
Render Elaine
No associations
LandOfFree
Rational subsets of polycyclic monoids and valence automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Rational subsets of polycyclic monoids and valence automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rational subsets of polycyclic monoids and valence automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-708611