Mikołaj Bojańczyk ; Bartek Klin ; Sławomir Lasota - Automata theory in nominal sets

lmcs:1157 - Logical Methods in Computer Science, August 15, 2014, Volume 10, Issue 3 - https://doi.org/10.2168/LMCS-10(3:4)2014
Automata theory in nominal setsArticle

Authors: Mikołaj Bojańczyk ; Bartek Klin ORCID; Sławomir Lasota ORCID

    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.


    Volume: Volume 10, Issue 3
    Published on: August 15, 2014
    Imported on: January 6, 2012
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory
    Funding:
      Source : OpenAIRE Graph
    • Expressive Power of Tree Logics; Funder: European Commission; Code: 239850

    51 Documents citing this article

    Consultation statistics

    This page has been seen 2003 times.
    This article's PDF has been downloaded 719 times.