Affine Parikh automata
Michaël Cadilhac, Alain Finkel, Pierre McKenzie (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
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 , that extends the PA by having each transition induce an affine transformation on the PA registers, and the , that restricts the PA by forcing any two transitions...