Mathematics – Logic
Scientific paper
2009-12-21
Mathematics
Logic
12 pages Accepted for STACS 2010
Scientific paper
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.
No associations
LandOfFree
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Collapsible Pushdown Graphs of Level 2 are Tree-Automatic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Collapsible Pushdown Graphs of Level 2 are Tree-Automatic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-301963