Document Open Access Logo

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

Author Alexander Kartzow



PDF
Thumbnail PDF

File

LIPIcs.STACS.2010.2480.pdf
  • Filesize: 301 kB
  • 12 pages

Document Identifiers

Author Details

Alexander Kartzow

Cite AsGet BibTex

Alexander Kartzow. Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 501-512, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.STACS.2010.2480

Abstract

We show that graphs generated by collapsible pushdown systems of level $2$ are tree-automatic. Even when we allow $\varepsilon$-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.
Keywords
  • Tree-automatic structures
  • collapsible pushdown graphs
  • collapsible pushdown systems
  • first-order decidability
  • reachability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail