Equivalence of Deterministic Nested Word to Word Transducers

被引：0
|
作者：
Staworko, Slawomir [1 ,3 ,4 ]
Laurence, Gregoire [2 ,3 ,4 ]
Lemay, Aurelien [2 ,3 ,4 ]
Niehren, Joachim [1 ,3 ,4 ]
机构：
[1] INRIA, Lille, France
[2] Univ Lille, Lille, France
[3] INRIA, Mostrare project, Rocquencourt, France
[4] CNRS, LIFL, UMR 8022, F-75700 Paris, France
来源：
FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS | 2009年 / 5699卷
关键词：
Trees; transducers; automata; context-free grammars; XML; CONTEXT-FREE LANGUAGES; TREE AUTOMATA;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust. Modulo polynomial time reductions, it can be identified with 4 equivalence problems for diverse classes of deterministic non-copying order-preserving transducers. In particular, we present polynomial time back and fourth reductions to the morphism equivalence problem on context free languages, which is known to be solvable in polynomial time.
引用
收藏
页码：310 / +
页数：3
相关论文
共 50 条
  • [21] State Complexity of Nested Word Automata
    Salomaa, Kai
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 59 - 70
  • [22] One-way Resynchronizability of Word Transducers
    Bose, Sougata
    Krishna, S. N.
    Muscholl, Anca
    Puppis, Gabriele
    [J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021, 2021, 12650 : 124 - 143
  • [23] On Computability of Data Word Functions Defined by Transducers
    Exibard, Leo
    Filiot, Emmanuel
    Reynier, Pierre-Alain
    [J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2020, 2020, 12077 : 217 - 236
  • [24] 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
  • [25] Descriptional Complexity of Unambiguous Nested Word Automata
    Okhotin, Alexander
    Salomaa, Kai
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 414 - +
  • [26] Operational state complexity of nested word automata
    Piao, Xiaoxue
    Salomaa, Kai
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (35) : 3290 - 3302
  • [27] Nondeterministic state complexity of nested word automata
    Han, Yo-Sub
    Salomaa, Kai
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (30-32) : 2961 - 2971
  • [28] Instrumenting C programs with nested word monitors
    Chaudhuri, Swarat
    Alur, Rajeev
    [J]. MODEL CHECKING SOFTWARE, PROCEEDINGS, 2007, 4595 : 279 - +
  • [29] Normal Form on Linear Tree-to-Word Transducers
    Boiret, Adrien
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 439 - 451
  • [30] Applications of Transducers in Independent Languages, Word Distances, Codes
    Konstantinidis, Stavros
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017, 2017, 10316 : 45 - 62
12345