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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2914, Issue , 2003, Pages 112-123

  Carayol, Arnaud ^a   Wöhrle, Stefan ^b  

^a CAMPUS DE BEAULIEU   (France)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CHARACTERIZATION; GRAPHIC METHODS; MAPPING; SOFTWARE ENGINEERING;

GRAPH TRANSFORMATION; HIERARCHICAL APPROACH; HIGHER-ORDER; INFINITE GRAPH; NON-ITERATIVE; PUSH-DOWN AUTOMATA; SECOND ORDERS;

GRAPH THEORY;

EID: 35248818286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_10     Document Type: Article

References (18)

1. A. Blumensath. Prefix-recognisable graphs and monadic second-order logic. Technical Report AIB-2001-06, RWTH Aachen, 2001.
2. T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, volume 2719 of LNCS, pages 556-569. Springer, 2003.
3. A. Carayol and T. Colcombet. On equivalent representations of infinite structures. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, volume 2719 of LNCS, pages 599-610. Springer, 2003.
4. A. Carayol and S. Wöhrle. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. Technical report, RWTH Aachen, 2003.
5. O. Carton and W. Thomas. The monadic theory of morphic infinite words and generalizations. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, volume 1893 of LNCS, pages 275-284. Springer, 2000.
6. D. Caucal. On infinite transition graphs having a decidable monadic theory. In Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, volume 1099 of LNCS, pages 194-205, 1996.
7. D. Caucal. On infinite terms having a decidable monadic theory. In Proceedings of the 27th International Symnposium on Mathematical Foundations of Computer Science, volume 2420 of LNCS, pages 165-176. Springer, 2002.
8. B. Courcelle. Monadic second-order definable graph transductions: A survey. Theoretical Computer Science, 126:53-75, 1994.
9. B. Courcelle and I. Walukiewicz. Monadic second-order logic, graph coverings and unfoldings of transition systems. Annals of Pure and Applied Logic, 92:35-62, 1998.
10. W. Damm. An algebraic extension of the Chomsky-hierarchy. In Proceedings of the 8th International Symposium on Mathematical Foundations of Computer Science, volume 74 of LNCS, pages 266-276. Springer, 1979.
11. W. Damm. The IO and OI hierarchies. Theoretical Computer Science, 20:95-208, 1982.
12. W. Damm and A. Goerdt. An automata-theoretical characterization of the OI-hierarchy. Information and Control, 71:1-32, 1986.
13. H.D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
14. J. Engelfriet. Iterated stack automata and complexity classes. Information and Computation, 95:21-75, 1991.
15. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pusdown trees are easy. In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, volume 2303 of LNCS, pages 205-222. Springer, 2002.
16. C. Stirling. Decidability of bisimulation equivalence for pushdown processes. Submitted.
17. W. Thomas. Constructing infinite graphs with a decidable MSO-theory. In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, volume 2747 of LNCS. Springer, 2003.
18. I. Walukiewicz. Monadic second-order logic on tree-like structures. Theoretical Computer Science, 275:311-346, 2002.