joint work with Lorenzo Clemente, Sławomir Lasota and Charles Paperman

This is a part of a plan to understand when two languages are separable by some regular language and actually a work in progress. I will show that regular separability is decidable for two languages of unambiguous Parikh automata. Then I will generalize this result to other similar classes of counting automata and present one concrete example: currently developed techniques for counting mechanisms described by Vector Addition Systems.