Rational subsets of polycyclic monoids and valence automata
| dc.creator | Render, Elaine | |
| dc.creator | Kambites, Mark | |
| dc.date | 2007-10-19 | |
| dc.date.accessioned | 2026-07-07T08:37:20Z | |
| dc.date.available | 2026-07-07T08:37:20Z | |
| dc.description | 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. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/0710.3711 | |
| dc.identifier | http://arxiv.org/abs/0710.3711 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/140369 | |
| dc.subject | Rings and Algebras | |
| dc.subject | 20M35; 68Q70 | |
| dc.title | Rational subsets of polycyclic monoids and valence automata | |
| dc.type | text |