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 条
  • [1] On the Balancedness of Tree-to-Word Transducers
    Loebel, Raphaela
    Luttenberger, Michael
    Seidl, Helmut
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2021, 32 (06) : 761 - 783
  • [2] Learning Sequential Tree-to-Word Transducers
    Laurence, Gregoire
    Lemay, Aurelien
    Niehren, Joachim
    Staworko, Slawek
    Tommasi, Marc
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 490 - 502
  • [3] Normal Form on Linear Tree-to-Word Transducers
    Boiret, Adrien
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 439 - 451
  • [4] Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
    Boiret, Adrien
    Palenta, Raphaela
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016, 2016, 9840 : 355 - 367
  • [5] Normalization of Sequential Top-Down Tree-to-Word Transducers
    Laurence, Gregoire
    Lemay, Aurelien
    Niehren, Joachim
    Staworko, Slawek
    Tommasi, Marc
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 354 - 365
  • [6] Total balancedness condition for Steiner tree games
    Fang, QZ
    Cai, MC
    Deng, XT
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 127 (03) : 555 - 563
  • [7] A comparison of pebble tree transducers with macro tree transducers
    Joost Engelfriet
    Sebastian Maneth
    [J]. Acta Informatica, 2003, 39 : 613 - 698
  • [8] A comparison of pebble tree transducers with macro tree transducers
    Engelfriet, J
    Maneth, S
    [J]. ACTA INFORMATICA, 2003, 39 (09) : 613 - 698
  • [9] TREE TRANSDUCERS AND TREE LANGUAGES
    BAKER, BS
    [J]. INFORMATION AND CONTROL, 1978, 37 (03): : 241 - 266
  • [10] Tree transducers and tree compressions
    Maneth, S
    Busatto, G
    [J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2004, 2987 : 363 - 377
12345