@inproceedings{broadbent:LIPIcs:2012:3433,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: Collapsible Pushdown Automata, First Order Logic, Logical Reflection},
    Author = {Broadbent, Christopher H.},
    BookTitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
    Editor = {D{\"u}rr, Christoph and Wilke, Thomas},
    File = {The Limits of Decidability for First Order Logic on CPDA Graphs - Broadbent (0) (0) - a - a - s.pdf},
    ISBN = {978-3-939897-35-4},
    ISSN = {1868-8969},
    Keywords = {higher-order pushdown automata and collapsible pushdown automata},
    Pages = {589--600},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{The Limits of Decidability for First Order Logic on CPDA Graphs}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3433},
    Volume = {14},
    Year = {2012},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2012/3433},
    bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.589},
    date-added = {2012-04-05 15:18:11 +0200},
    date-modified = {2012-04-05 13:18:49 +0000},
    urn = {urn:nbn:de:0030-drops-34334},
    doi = {10.4230/LIPIcs.STACS.2012.589}
}

@inproceedings{broadbent:LIPIcs:2012:3433, Address = {Dagstuhl, Germany}, Annote = {Keywords: Collapsible Pushdown Automata, First Order Logic, Logical Reflection}, Author = {Broadbent, Christopher H.}, BookTitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, Editor = {D{\"u}rr, Christoph and Wilke, Thomas}, File = {The Limits of Decidability for First Order Logic on CPDA Graphs - Broadbent (0) (0) - a - a - s.pdf}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, Keywords = {higher-order pushdown automata and collapsible pushdown automata}, Pages = {589--600}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{The Limits of Decidability for First Order Logic on CPDA Graphs}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3433}, Volume = {14}, Year = {2012}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2012/3433}, bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.589}, date-added = {2012-04-05 15:18:11 +0200}, date-modified = {2012-04-05 13:18:49 +0000}, urn = {urn:nbn:de:0030-drops-34334}, doi = {10.4230/LIPIcs.STACS.2012.589} }