Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata

  • Christopher Broadbent
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)

Abstract

We introduce two natural variants of prefix rewriting on nested-words. One captures precisely the transition graphs of order-2 pushdown automata and the other precisely those of order-2 collapsible pushdown automata (2-CPDA). To our knowledge this is the first precise ‘external’ characterisation of 2-CPDA graphs and demonstrates that the class is robust and hence interesting in its own right. The comparison with our characterisation for 2-PDA graphs also gives an idea of what ‘collapse means’ in terms outside of higher-order automata theory. Additionally, a related construction gives us a decidability result for first-order logic on a natural subclass of 3-CPDA graphs, which in some sense is optimal.

Keywords

Decidability Result Regular Language Transition Graph Tree Automaton Recursion Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of Nested Trees. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 329–342. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Alur, R., Madhusudan, P.: Visibly Pushdown Languages. In: STOC, pp. 202–211. ACM (2004)Google Scholar
  3. 3.
    Alur, R., Madhusudan, P.: Adding nesting structure to words. Journal of the ACM (JACM) 56(3), 1–43 (2009)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Arenas, M., Barcelo, P., Libkin, L.: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. Theory Comput. Syst. 49(3), 639–670 (2011)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Blumensath, A., Gradel, E.: Automatic structures. In: LICS, pp. 51–62. IEEE Comput. Soc. (2000)Google Scholar
  6. 6.
    Braud, L., Carayol, A.: Linear Orders in the Pushdown Hierarchy. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 88–99. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Broadbent, C.: The Limits of Decidability for First-Order Logic on CPDA Graphs. In: STACS (2012)Google Scholar
  8. 8.
    Carayol, A.: Regular Sets of Higher-Order Pushdown Stacks. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 168–179. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Carayol, A., Wöhrle, S.: The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 112–123. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Caucal, D.: On Infinite Transition Graphs Having a Decidable Monadic Theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194–205. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  11. 11.
    Caucal, D.: On Infinite Terms Having a Decidable Monadic Theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165–176. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Delhommé, C.: Automaticité des ordinaux et des graphes homogčnes. Comptes Rendus Mathematique 339(1), 5–10 (2004)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Gaifman, H.: On Local and Non-Local Properties. In: Stern, J. (ed.) Proceedings of the Herbrand Symposium. Studies in Logic and the Foundations of Mathematics, vol. 107, pp. 105–135. Elsevier (1982)Google Scholar
  14. 14.
    Hague, M., Murawski, A.S., Ong, C.-H.L., Serre, O.: Collapsible Pushdown Automata and Recursion Schemes. In: LICS. IEEE Computer Society (2008)Google Scholar
  15. 15.
    Kartzow, A.: Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. In: STACS, pp. 501–512 (2010)Google Scholar
  16. 16.
    Khoussainov, B., Nerode, A.: Automatic Presentations of Structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  17. 17.
    Knapik, T., Niwiński, D., Urzyczyn, P.: Higher-Order Pushdown Trees Are Easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 205–222. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  18. 18.
    Knapik, T., Niwiński, D., Urzyczyn, P., Walukiewicz, I.: Unsafe Grammars and Panic Automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1450–1461. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  19. 19.
    Stirling, C.: Decidability of Bisimulation Equivalence for Pushdown processes. Tech. Report, Division of Informatics, University of Edinburgh (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Christopher Broadbent
    • 1
  1. 1.LIAFA (CNRS and Paris 7)ParisFrance

Personalised recommendations