Comments and questions to:
eptcs@eptcs.org
|
|
For website issues:
webmaster@eptcs.org
|
|
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. |
| ArXived at: http://dx.doi.org/10.4204/EPTCS.63.13 | bibtex |
|
Comments and questions to:
eptcs@eptcs.org
|
|
For website issues:
webmaster@eptcs.org
|