Bounded Parikh Automata
The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is the class of boun...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2011-08-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1108.3625v1 |
| _version_ | 1818451502385070080 |
|---|---|
| author | Michaël Cadilhac Alain Finkel Pierre McKenzie |
| author_facet | Michaël Cadilhac Alain Finkel Pierre McKenzie |
| author_sort | Michaël Cadilhac |
| collection | DOAJ |
| description | The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is the class of bounded languages whose set of iterations is semilinear. |
| first_indexed | 2024-12-14T21:08:13Z |
| format | Article |
| id | doaj.art-2a6f4072a7db4951a5a52ef9f77cf330 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-14T21:08:13Z |
| publishDate | 2011-08-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-2a6f4072a7db4951a5a52ef9f77cf3302022-12-21T22:47:20ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802011-08-0163Proc. WORDS 20119310210.4204/EPTCS.63.13Bounded Parikh AutomataMichaël CadilhacAlain FinkelPierre McKenzieThe Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is the class of bounded languages whose set of iterations is semilinear.http://arxiv.org/pdf/1108.3625v1 |
| spellingShingle | Michaël Cadilhac Alain Finkel Pierre McKenzie Bounded Parikh Automata Electronic Proceedings in Theoretical Computer Science |
| title | Bounded Parikh Automata |
| title_full | Bounded Parikh Automata |
| title_fullStr | Bounded Parikh Automata |
| title_full_unstemmed | Bounded Parikh Automata |
| title_short | Bounded Parikh Automata |
| title_sort | bounded parikh automata |
| url | http://arxiv.org/pdf/1108.3625v1 |
| work_keys_str_mv | AT michaelcadilhac boundedparikhautomata AT alainfinkel boundedparikhautomata AT pierremckenzie boundedparikhautomata |