1 paper · 1 filter
Mario Grobler, Leif Sabellek, Sebastian Siebertz
We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh auto…