文章基本信息

标题：Ordered Tree-Pushdown Systems
本地全文：下载
作者：Lorenzo Clemente ; Pawel Parys ; Sylvain Salvati 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2015
卷号：45
页码：163-177
DOI：10.4230/LIPIcs.FSTTCS.2015.163
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering restriction, and we show that the resulting class enjoys a decidable reachability problem. This follows from a preservation of recognizability result for the backward reachability relation of such systems. As an application, we show that our simple model can encode several formalisms generalizing pushdown systems, such as ordered multi-pushdown systems, annotated higher-order pushdown systems, the Krivine machine, and ordered annotated multi-pushdown systems. In each case, our procedure yields tight complexity.
关键词：reachability analysis; saturation technique; pushdown automata; ordered pushdown automata; higher-order pushdown automata; higher-order recursive sche