A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata
[chapter]
2003
Lecture Notes in Computer Science
In this paper we give two equivalent characterizations of the Caucal hierarchy, a hierarchy of infinite graphs with a decidable monadic second-order (MSO) theory. It is obtained by iterating the graph transformations of unfolding and inverse rational mapping. The first characterization sticks to this hierarchical approach, replacing the languagetheoretic operation of a rational mapping by an MSO-transduction and the unfolding by the treegraph operation. The second characterization is
doi:10.1007/978-3-540-24597-1_10
fatcat:hfabghdqxvan5ne5axcsk65exu