Corpus ID: 14698558

A decidable class of (nominal) omega-regular languages over an infinite alphabet

@article{Ciancia2013ADC,
  title={A decidable class of (nominal) omega-regular languages over an infinite alphabet},
  author={V. Ciancia and Matteo Sammartino},
  journal={ArXiv},
  year={2013},
  volume={abs/1310.3945}
}
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… Expand

References

SHOWING 1-10 OF 32 REFERENCES
Safety alternating automata on data words
  • R. Lazic
  • Computer Science, Mathematics
  • TOCL
  • 2011
  • 17
  • PDF
Variable Automata over Infinite Alphabets
  • 78
  • PDF
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
  • 69
  • PDF
Automata with Group Actions
  • 92
  • PDF
Fresh-register automata
  • 60
  • PDF
An Automaton over Data Words That Captures EMSO Logic
  • B. Bollig
  • Mathematics, Computer Science
  • CONCUR
  • 2011
  • 27
  • PDF
Ultimately Periodic Words of Rational w-Languages
  • 46
Towards nominal computation
  • 52
  • PDF
Finite-Memory Automata
  • 385
  • PDF
Automata and Logics for Words and Trees over an Infinite Alphabet
  • 188
  • PDF
...
1
2
3
4
...