Regular Separability of Parikh Automata
2016
We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is disjoint from the other?
Keywords:
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
0
References
3
Citations
NaN
KQI