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
关键词
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 条
  • [1] Reversible Pushdown Transducers
    Guillon, Bruno
    Kutrib, Martin
    Malcher, Andreas
    Prigioniero, Luca
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 354 - 365
  • [2] Visibly pushdown transducers
    Raskin, Jean-Francois
    Servais, Frederic
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 2, PROCEEDINGS, 2008, 5126 : 386 - +
  • [3] Visibly pushdown transducers
    Filiot, Emmanuel
    Raskin, Jean-Francois
    Reynier, Pierre-Alain
    Servais, Frederic
    Talbot, Jean-Marc
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2018, 97 : 147 - 181
  • [4] PROPERTIES OF FINITE AND PUSHDOWN TRANSDUCERS
    CHOFFRUT, C
    CULIK, K
    SIAM JOURNAL ON COMPUTING, 1983, 12 (02) : 300 - 315
  • [5] Alphabetic pushdown tree transducers
    Rahonis, G
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2003, 2710 : 423 - 436
  • [6] Properties of Visibly Pushdown Transducers
    Filiot, Emmanuel
    Raskin, Jean-Francois
    Reynier, Pierre-Alain
    Servais, Frederic
    Talbot, Jean-Marc
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 355 - +
  • [7] Expressiveness of Visibly Pushdown Transducers
    Caralp, Mathieu
    Reynier, Pierre-Alain
    Talbot, Jean-Marc
    Filiot, Emmanuel
    Servais, Frederic
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (134): : 17 - 26
  • [8] NIVAT THEOREM FOR PUSHDOWN TRANSDUCERS
    KARNER, G
    THEORETICAL COMPUTER SCIENCE, 1992, 97 (02) : 245 - 262
  • [9] Reversible Pushdown Automata
    Kutrib, Martin
    Malcher, Andreas
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 368 - 379
  • [10] Reversible pushdown automata
    Kutrib, Martin
    Malcher, Andreas
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (06) : 1814 - 1827