@inproceedings{kartzow:LIPIcs:2010:2480,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Tree-automatic structures, collapsible pushdown graphs, collapsible pushdown systems, first-order decidability, reachability},
Author = {Kartzow, Alexander},
BookTitle = {27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010)},
Editor = {Marion, Jean-Yves and Schwentick, Thomas},
File = {Collapsible Pushdown Graphs of Level 2 are Tree-Automatic - Kartzow (0) (1) - a - a - r.pdf},
ISBN = {978-3-939897-16-3},
ISSN = {1868-8969},
Keywords = {higher-order pushdown automata and higher-order recursion schemes and collapsible pushdown automata},
Pages = {501--512},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {Collapsible Pushdown Graphs of Level 2 are Tree-Automatic},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2480},
Volume = {5},
Year = {2010},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2010/2480},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2480},
date-added = {2012-03-06 18:52:57 +0100},
date-modified = {2012-03-06 17:53:31 +0000},
doi = {10.4230/LIPIcs.STACS.2010.2480}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A