A pumping lemma and decidability problems for recognizable tree series

IF 0.3 Q4 COMPUTER SCIENCE, CYBERNETICS

Acta Cybernetica Pub Date : 2004-09-01 DOI:10.5555/1052050.1052052

BorchardtBjörn

引用次数: 0

Abstract

In the present paper we show that given a tree series S, which is accepted by (a) a deterministic bottom-up finite state weighted tree automaton (for short: bu-w-fta) or (b) a non-deterministic bu-...

查看原文本刊更多论文

可识别树序列的抽运引理及可判定性问题

在本文中，我们证明了给定一个树序列S，它被(a)一个确定性的自底向上有限状态加权树自动机(简称:bu-w-fta)或(b)一个非确定性的bu- fta所接受。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Acta Cybernetica COMPUTER SCIENCE, CYBERNETICS-

CiteScore

1.10

自引率

0.00%

发文量

期刊介绍： Acta Cybernetica publishes only original papers in the field of Computer Science. Manuscripts must be written in good English.