10 citations · 17 across the 10 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.FL2011★ 4 cited
Bounded Parikh Automata
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
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 recog…
cs.FL2011★ 10 cited
On the expressiveness of Parikh automata and related models
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
The Parikh finite word automaton (PA) was introduced and studied by Klaedtke and Ruess in 2003. Natural variants of the PA arise from viewing a PA equivalently as an automaton that…