Automata theory in nominal sets

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.

Cited by in corpus (5)

• SMT Solving for Functional Programming over Infinite Structures
• Algebras of UTxO blockchains
• Equivariant ZFA and the foundations of nominal techniques
• On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars
• On Learning Nominal Automata with Binders