Regular Separability of Parikh Automata
Formal Languages and Automata Theory
2016-12-20 v1
Abstract
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
Cite
@article{arxiv.1612.06233,
title = {Regular Separability of Parikh Automata},
author = {Lorenzo Clemente and Wojciech Czerwiński and Sławomir Lasota and Charles Paperman},
journal= {arXiv preprint arXiv:1612.06233},
year = {2016}
}