当前位置:
X-MOL 学术
›
Theory Comput. Syst.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
Theory of Computing Systems ( IF 0.6 ) Pub Date : 2021-03-26 , DOI: 10.1007/s00224-020-10021-w Erik Paul
中文翻译:
明确的Max-Plus树自动机的有限顺序
更新日期:2021-03-27
Theory of Computing Systems ( IF 0.6 ) Pub Date : 2021-03-26 , DOI: 10.1007/s00224-020-10021-w Erik Paul
We show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree automata whose pointwise maximum is equivalent to the given automaton.
中文翻译:
明确的Max-Plus树自动机的有限顺序
我们展示了明确的最大加法树自动机的有限序列问题的可判定性。如果每棵树上最多有一个接受运行,则最大加最大树自动机称为明确。有限序列问题询问对于给定的最大加法树自动机,是否存在有限的确定性最大加法树自动机,其点向最大值等于给定的自动机。