Electronic Proceedings in Theoretical Computer Science (Aug 2011)

Bounded Parikh Automata

  • Michaël Cadilhac,
  • Alain Finkel,
  • Pierre McKenzie

DOI
https://doi.org/10.4204/EPTCS.63.13
Journal volume & issue
Vol. 63, no. Proc. WORDS 2011
pp. 93 – 102

Abstract

Read online

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.