2013/10/15 by Vincenzo Ciancia, Ciancia, Vincenzo, Matteo Sammartino +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Chemical Synthesis and Analysis #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1310.3945
openalex publication_date 2013/10/15 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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 infinite-state) defined class of automata.