Skip to Main content Skip to Navigation
New interface
Conference papers

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

Alexander Kartzow 1, * 
* Corresponding author
Abstract : We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow $\epsilon$-contractions and add a reachability predicate (with regular constraints) for pairs of configurations, the structures remain tree-automatic. Hence, their FO theories are decidable, even when expanded by a reachability predicate. As a corollary, we obtain the tree-automaticity of the second level of the Caucal-hierarchy.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, February 11, 2010 - 9:56:52 AM
Last modification on : Wednesday, September 7, 2022 - 3:36:04 PM
Long-term archiving on: : Friday, June 18, 2010 - 8:09:32 PM


Files produced by the author(s)


  • HAL Id : inria-00455744, version 1



Alexander Kartzow. Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.501-512. ⟨inria-00455744⟩



Record views


Files downloads