Bounded Parikh Automata

Michaël Cadilhac
(DIRO, Université de Montréal)
Alain Finkel
(LSV, ENS Cachan & CNRS)
Pierre McKenzie
(DIRO, Université de Montréal)

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.

In Petr Ambrož, Štěpán Holub and Zuzana Masáková: Proceedings 8th International Conference Words 2011 (WORDS 2011), Prague, Czech Republic, 12-16th September 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 93–102.
Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.13 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org