文章基本信息

标题：The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable
本地全文：下载
作者：Erik Paul
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：83
页码：53:1-53:13
DOI：10.4230/LIPIcs.MFCS.2017.53
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We show that the equivalence, unambiguity and sequentiality problems are decidable for finitely ambiguous max-plus tree automata.
关键词：Tree Automata; Max-Plus Automata; Equivalence; Unambiguity; Sequentiality; Decidability