License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2010.2480
URN: urn:nbn:de:0030-drops-24801
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2480/
Kartzow, Alexander
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
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.
BibTeX - Entry
@InProceedings{kartzow:LIPIcs:2010:2480,
author = {Alexander Kartzow},
title = {{Collapsible Pushdown Graphs of Level 2 are Tree-Automatic}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {501--512},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-16-3},
ISSN = {1868-8969},
year = {2010},
volume = {5},
editor = {Jean-Yves Marion and Thomas Schwentick},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2480},
URN = {urn:nbn:de:0030-drops-24801},
doi = {10.4230/LIPIcs.STACS.2010.2480},
annote = {Keywords: Tree-automatic structures, collapsible pushdown graphs, collapsible pushdown systems, first-order decidability, reachability}
}
Keywords: |
|
Tree-automatic structures, collapsible pushdown graphs, collapsible pushdown systems, first-order decidability, reachability |
Collection: |
|
27th International Symposium on Theoretical Aspects of Computer Science |
Issue Date: |
|
2010 |
Date of publication: |
|
09.03.2010 |