On the Balancedness of Tree-to-Word Transducers

被引：0

作者：

Loebel, Raphaela ^{[1
]}

Luttenberger, Michael ^{[1
]}

Seidl, Helmut ^{[1
]}

机构：

[1] Tech Univ Munich, Munich, Germany

来源：

DEVELOPMENTS IN LANGUAGE THEORY, DLT 2020 | 2020年 / 12086卷

关键词：

Balancedness of tree-to-word transducer; Equivalence; Longest common suffix/prefix of a CFG;

D O I：

10.1007/978-3-030-48516-0_17

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A language over an alphabet B = A boolean OR (A) over bar of opening (A) and closing (A) over bar brackets, is balanced if it is a subset of the Dyck language D-B over B, and it is well-formed if all words are prefixes of words in D-B. We show that well-formedness of a context-free language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide for the class 2-TW of non-linear tree transducers with output alphabet B* whether or not the output language is balanced.

引用

页码：222 / 236

页数：15

共 50 条

[21] HIGH-LEVEL TREE-TRANSDUCERS AND ITERATED PUSHDOWN TREE-TRANSDUCERS
ENGELFRIET, J
VOGLER, H
[J]. ACTA INFORMATICA, 1988, 26 (1-2) : 131 - 192
[22] Alphabetic and synchronized tree transducers
Rahonis, G
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 377 - 399
[23] Restricted ground tree transducers
Fülöp, Z
Vágvölgyi, S
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 250 (1-2) : 219 - 233
[24] Iterated relabeling tree transducers
Fülöp, Z
Terlutte, A
[J]. THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 221 - 244
[25] Linking theorems for tree transducers
Fulop, Zoltan
Maletti, Andreas
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2016, 82 (07) : 1201 - 1222
[26] Weighted Extended Tree Transducers
Fueloep, Zoltan
Maletti, Andreas
Vogler, Heiko
[J]. FUNDAMENTA INFORMATICAE, 2011, 111 (02) : 163 - 202
[27] Monadic Datalog Tree Transducers
Buechse, Matthias
Stueber, Torsten
[J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 267 - 278
[28] Equivalence of Symbolic Tree Transducers
Hugot, Vincent
Boiret, Adrien
Niehren, Joachim
[J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 109 - 121
[29] BASIC TREE-TRANSDUCERS
VOGLER, H
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 214 : 183 - 195
[30] Alphabetic pushdown tree transducers
Rahonis, G
[J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2003, 2710 : 423 - 436

← 1 2 3 4 5 →