Automata theory in nominal sets

Bartek Klin (University of Warsaw); Miko{\l}aj Boja\'nczyk (University of Warsaw); S{\l}awomir Lasota (University of Warsaw)

arxiv: 1402.0897 · v2 · pith:URL6ZF6Jnew · submitted 2014-02-04 · 💻 cs.LO · cs.FL

Automata theory in nominal sets

Miko{\l}aj Boja\'nczyk (University of Warsaw) , Bartek Klin (University of Warsaw) , S{\l}awomir Lasota (University of Warsaw) This is my paper

classification 💻 cs.LO cs.FL

keywords automataalphabetsnominalsetstheoryalphabetautomorphismdevelop

0 comments

read the original 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.

This paper has not been read by Pith yet.

Automata theory in nominal sets

discussion (0)