1 paper
Luisa Herrmann, Johannes Osterholzer
Parikh (tree) automata are an expressive and yet computationally well-behaved extension of finite automata -- they allow to increment a number of counters during their computations…