Repository landing page
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Abstract
International audienceWe show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow -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- info:eu-repo/semantics/conferenceObject
- Conference papers
- tree-automatic structures
- collapsible pushdown graphs
- collapsible pushdown systems
- first-order decidability
- reachability
- ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic
- [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]