Reversible pushdown transducers

被引：0

作者：

Guillon, Bruno ^{[1
]}

Kutrib, Martin ^{[2
]}

Malcher, Andreas ^{[2
]}

Prigioniero, Luca ^{[2
,3
]}

机构：

[1] Univ Clermont Auvergne, LIMOS, Aubiere, France

[2] Univ Giessen, Inst Informat, Arndtstr 2, D-35392 Giessen, Germany

[3] Univ Milan, Dipartimento Informat, Via Celoria 18, I-20133 Milan, Italy

来源：

INFORMATION AND COMPUTATION | 2021年 / 281卷

关键词：

Pushdown transducers; Reversible computations; Computational capacity; Transduction hierarchies;

D O I：

10.1016/j.ic.2021.104813

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Deterministic pushdown transducers are studied with respect to their ability to compute reversible transductions, that is, to transform inputs into outputs in a reversible way. This means that the transducers are also backward deterministic and thus are able to uniquely step the computation back and forth. The families of transductions computed are classified with regard to four types of length-preserving transductions as well as to the property of working reversibly. It turns out that accurate to one case separating witness transductions can be provided. For the remaining case it is possible to establish the equivalence of both families by proving that stationary moves can always be removed in length-preserving reversible pushdown transductions. (C) 2021 Elsevier Inc. All rights reserved.

引用

页数：16

共 50 条

[21] Two-Way Visibly Pushdown Automata and Transducers
Dartois, Luc
Filiot, Emmanuel
Reynier, Pierre-Alain
Talbot, Jean-Marc
PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 217 - 226
[22] HIGH-LEVEL TREE-TRANSDUCERS AND ITERATED PUSHDOWN TREE-TRANSDUCERS
ENGELFRIET, J
VOGLER, H
ACTA INFORMATICA, 1988, 26 (1-2) : 131 - 192
[23] PUSHDOWN TRANSDUCERS AND SYNTACTICAL ANALYSIS FOR SOME CLASSES OF GRAMMARS
KUZENKO, VF
DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1976, (01): : 71 - 73
[24] The equivalence problem for deterministic pushdown transducers into abelian groups
Sénizergues, G
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 305 - 315
[25] Boosting Reversible Pushdown and Queue Machines by Preprocessing
Axelsen, Holger Bock
Kutrib, Martin
Malcher, Andreas
Wendlandt, Matthias
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (08) : 1021 - 1049
[26] Reversible Shrinking Two-Pushdown Automata
Axelsen, Holger Bock
Holzer, Markus
Kutrib, Martin
Malcher, Andreas
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 579 - 591
[27] CONTROL FOR REVERSIBLE TRANSDUCERS
SOBOLEV, LB
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII RADIOELEKTRONIKA, 1992, 35 (3-4): : 46 - 51
[28] Scalable XML Query Processing using Parallel Pushdown Transducers
Ogden, Peter
Thomas, David
Pietzuch, Peter
PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (14): : 1738 - 1749
[29] One-Counter Pushdown-Storage Automata as Transducers of Sequences
Ivanov I.E.
Moscow University Mathematics Bulletin, 2018, 73 (4) : 164 - 167
[30] A GPU-accelerated Data Transformation Framework Rooted in Pushdown Transducers
Tri Nguyen
Becchi, Michela
2022 IEEE 29TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, DATA, AND ANALYTICS, HIPC, 2022, : 215 - 225

← 1 2 3 4 5 →