The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata

@inproceedings{Carayol2003TheCH,
  title={The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata},
  author={Arnaud Carayol and Stefan W{\"o}hrle},
  booktitle={FSTTCS},
  year={2003}
}
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 non… CONTINUE READING
86 Citations
18 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata

  • A. Carayol, S. Wöhrle
  • Technical report, RWTH Aachen,
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…