Regular sets of higher-order pushdown stacks

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 168-179

  Carayol, Arnaud ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; GRAPH THEORY;

AUTOMATONS; CANONICAL STRUCTURES; INFINITE GRAPHS; PUSHDOWN AUTOMATA; STACK CONTENTS;

SET THEORY;

EID: 26844504527     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_16     Document Type: Conference Paper

References (18)

1. [Aho69] Alfred V. Aho. Nested stack automata. J. ACM, 16(3):383-406, 1969.
2. [BEM97] A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Proc. of CONCUR '97, volume 1243 of LNCS, pages 135-150. Springer Verlag, 1997.
3. [Blu01] A. Blumensath. Prefix-recognisable graphs and monadic second-order logic. Technical Report AIB-2001-06, RWTH Aachen, 2001.
4. [BM04] A. Bouajjani and A. Meyer. Symbolic reachability analysis of higher-order context-free processes. In Proc. of FSTTCS '04, volume 3328 of LNCS, pages 135-147. Springer Verlag, 2004.
5. [Büc64] R. Büchi. Regular canonical systems. In Archiv fur Math. Logik und Grundlagenforschung 6, pages 91-111, 1964.
6. [Car05] A. Carayol. Regular sets of higher-order pushdown stacks. Extended version. A preliminary version of this article is available at the address http://www.irisa.fr/galion/acarayol/, 2005.
7. [Cau96a] D. Caucal. On infinite transition graphs having a decidable monadic theory. In Proc. of ICALP '96, volume 1099 of LNCS, pages 194-205. Springer Verlag, 1996.
8. [Cau96b] D. Caucal. Sur des graphes infinis réguliers. Habilitation thesis, Université de Rennes 1, 1996.
9. [Cau02] D. Caucal. On infinite terms having a decidable monadic theory. In Proc. of MFCS '02, volume 2420 of LNCS, pages 165-176. Springer Verlag, 2002.
10. [Cau03] D. Caucal. On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci., 290:79-115, 2003.
11. [CW03] A. Carayol and S. Wöhrle. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In Proc. of FSTTCS '03, volume 2914 of LNCS, pages 112-123. Springer Verlag, 2003.
12. [Dam82] W. Damm. The OI- and IO-hierarchies. Theor. Comput. Sci., 20(2):95-207, 1982.
13. [EF95] H.D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
14. [Eng83] J. Engelfriet. Iterated pushdown automata and complexity classes. In Proc. of STOC '83, pages 365-373. ACM Press, 1983.
15. [Gre70] S. Greibach. Full AFL's and nested iterated substitution. Inf. Control, 16(1):7-35, 1970.
16. [KNU02] T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pusdown trees are easy. In Proc. of FoSSaCS '02, volume 2303 of LNCS, pages 205-222. Springer Verlag, 2002.
17. [Mas76] A.N. Maslov. Multilevel stack automata. Problemy Peredachi Informatsii, 12:55-62, 1976.
18. [Tho03] W. Thomas. Constructing infinite graphs with a decidable MSO-theory. In Proc. of MFCS '03, volume 2747 of LNCS, pages 113-124. Springer Verlag, 2003.