A decidable class of (nominal) omegaregular languages over an infinite alphabet
Abstract
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably, the obtained languages are determined by their ultimately periodic fragments, as in the classical case. Closure under complement, union and intersection, and decidability of emptiness and equivalence are preserved by the generalisation. This is shown by using finite representations of the (otherwise infinitestate) defined class of automata.
 Publication:

arXiv eprints
 Pub Date:
 October 2013
 arXiv:
 arXiv:1310.3945
 Bibcode:
 2013arXiv1310.3945C
 Keywords:

 Computer Science  Formal Languages and Automata Theory;
 Computer Science  Logic in Computer Science