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

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 10, Issue 3
Main Authors:	Bojańczyk, Mikołaj, Klin, Bartek, Lasota, Sławomir
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 15.08.2014
Subjects:	computer science - formal languages and automata theory computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!