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 sets

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

    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
    Accepted on: June 25, 2015
    Submitted on: January 6, 2012
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory
    Fundings :
      Source : OpenAIRE Research Graph
    • Expressive Power of Tree Logics; Funder: European Commission; Code: 239850

    Linked data

    Source : ScholeXplorer IsCitedBy DOI 10.4230/lipics.concur.2021.4
    • 10.4230/lipics.concur.2021.4
    Nominal Büchi Automata with Name Allocation
    Urbat, Henning ; Hausmann, Daniel ; Milius, Stefan ; Schröder, Lutz ;

    40 Documents citing this article


    Consultation statistics

    This page has been seen 943 times.
    This article's PDF has been downloaded 433 times.