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 条

[1] Earliest Query Answering for Deterministic Nested Word Automata
Gauwin, Olivier
Niehren, Joachim
Tison, Sophie
[J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2009, 5699 : 121 - +
[2] Limitations of lower bound methods for deterministic nested word automata
Salomaa, Kai
[J]. INFORMATION AND COMPUTATION, 2011, 209 (03) : 580 - 589
[3] 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
[4] Word Use Equivalence and Hierarchical Word Tiers
Burch, Brent
Egbert, Jesse
[J]. JOURNAL OF QUANTITATIVE LINGUISTICS, 2023, 30 (01) : 104 - 124
[5] A word-to-word model of translational equivalence
Melamed, ID
[J]. 35TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 8TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, 1997, : 490 - 497
[6] The (nested) word problem
Henry, Christopher S.
[J]. INFORMATION PROCESSING LETTERS, 2016, 116 (11) : 729 - 734
[7] DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC FINITE TRANSDUCERS
BLATTNER, M
HEAD, T
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 19 (01) : 45 - 49
[8] ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN TRANSDUCERS
IBARRA, OH
ROSIER, LE
[J]. INFORMATION PROCESSING LETTERS, 1981, 13 (03) : 89 - 93
[9] SYNTHESIS OF DATA WORD TRANSDUCERS
Exibard, Leo
Filiot, Emmanuel
Reynier, Pierre-Alain
[J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (01) : 22:1 - 22:25
[10] ON THE EQUIVALENCE PROBLEM FOR DETERMINISTIC MULTITAPE AUTOMATA AND TRANSDUCERS
CULIK, K
KARHUMAKI, J
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 468 - 479

← 1 2 3 4 5 →