Automata theory in nominal sets

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Logical methods in computer science Jg. 10, Issue 3
Hauptverfasser:	Bojańczyk, Mikołaj, Klin, Bartek, Lasota, Sławomir
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science e.V 15.08.2014
Schlagworte:	computer science - formal languages and automata theory computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1860-5974 1860-5974
DOI:	10.2168/LMCS-10(3:4)2014