Automata theory in nominal sets
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Feb 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 1.
5 papers.
- 2023Nominal Topology for Data Languagescited by 1
- 2024Bi-reachability in Petri nets with datacited by 1
- 2025Extracting Robust Register Automata from Neural Networks over Data Sequencescited by 1
- 2022Solvability of orbit-finite systems of linear equationscited by 0
- 2026Learning Canonical Register Automata over Ordered Data Domainscited by 0
- 2026Learning Canonical Register Automata over Ordered Data Domains19 Aug 2026
- 2025Extracting Robust Register Automata from Neural Networks over Data Sequences24 Nov 2025
- 2024Bi-reachability in Petri nets with data25 May 2024
- 2023Nominal Topology for Data Languages26 Apr 2023
- 2022Solvability of orbit-finite systems of linear equations22 Jan 2022