Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-301963

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.