@article{CadilhacFinkelMcKenzie:IJFCS:2012,
Abstract = {The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Rue{\ss}. Here, we present some expressiveness properties of a restriction of the deterministic affine PA recently introduced, and use them as a tool to show that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is shown equal to the class of bounded languages with a semilinear iteration set.},
Author = {Cadilhac, Micha\"{e}l and Finkel, Alain and McKenzie, Pierre},
EPrint = {https://doi.org/10.1142/S0129054112400709},
File = {Bounded Parikh Automata - 40b.pdf},
Journal = {International Journal of Foundations of Computer Science},
Number = {08},
Pages = {1691--1709},
Title = {Bounded Parikh Automata},
URL = {https://doi.org/10.1142/S0129054112400709},
Volume = {23},
Year = {2012},
bdsk-url-1 = {https://doi.org/10.1142/S0129054112400709},
date-added = {2022-07-01 12:43:06 +0200},
date-modified = {2022-07-01 12:43:06 +0200},
doi = {10.1142/S0129054112400709}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A