Joost Engelfriet ; Heiko Vogler - A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage

dmtcs:5424 - Discrete Mathematics & Theoretical Computer Science, August 27, 2020, vol. 22 no. 4 - https://doi.org/10.23638/DMTCS-22-4-3
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage

Authors: Joost Engelfriet ; Heiko Vogler

    We introduce MSO graph storage types, and call a storage type MSO-expressible if it is isomorphic to some MSO graph storage type. An MSO graph storage type has MSO-definable sets of graphs as storage configurations and as storage transformations. We consider sequential automata with MSO graph storage and associate with each such automaton a string language (in the usual way) and a graph language; a graph is accepted by the automaton if it represents a correct sequence of storage configurations for a given input string. For each MSO graph storage type, we define an MSO logic which is a subset of the usual MSO logic on graphs. We prove a Büchi-Elgot-Trakhtenbrot theorem, both for the string case and the graph case. Moreover, we prove that (i) each MSO graph transduction can be used as storage transformation in an MSO graph storage type, (ii) every automatic storage type is MSO-expressible, and (iii) the pushdown operator on storage types preserves the property of MSO-expressibility. Thus, the iterated pushdown storage types are MSO-expressible.


    Volume: vol. 22 no. 4
    Section: Automata, Logic and Semantics
    Published on: August 27, 2020
    Accepted on: August 3, 2020
    Submitted on: May 3, 2019
    Keywords: Computer Science - Formal Languages and Automata Theory

    Linked data

    Source : ScholeXplorer HasVersion DOI 10.48550/arxiv.1905.00559
    • 10.48550/arxiv.1905.00559
    A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
    Engelfriet, Joost ; Vogler, Heiko ;

    Share

    Consultation statistics

    This page has been seen 339 times.
    This article's PDF has been downloaded 145 times.