Article contents
Affine Parikh automata∗
Published online by Cambridge University Press: 02 August 2012
Abstract
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the affine PA, that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters, that restricts the PA by forcing any two transitions on the same letter to affect the registers equally. Then we report on the expressiveness, closure, and decidability properties of such PA variants. We note that deterministic PA are strictly weaker than deterministic reversal-bounded counter machines.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 46 , Issue 4: Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011) , October 2012 , pp. 511 - 545
- Copyright
- © EDP Sciences 2012
References
- 15
- Cited by