Automata theory in nominal sets
Logic in Computer Science
2015-07-01 v2 Formal Languages and Automata Theory
Abstract
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.
Keywords
Cite
@article{arxiv.1402.0897,
title = {Automata theory in nominal sets},
author = {Mikołaj Bojańczyk and Bartek Klin and Sławomir Lasota},
journal= {arXiv preprint arXiv:1402.0897},
year = {2015}
}