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 条
  • [41] Pushdown specifications
    Kupferman, O
    Piterman, N
    Vardi, MY
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2002, 2514 : 262 - 277
  • [42] On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops
    Masopust, Tomas
    Meduna, Alexander
    ACTA CYBERNETICA, 2009, 19 (02): : 537 - 552
  • [43] On probabilistic pushdown automata
    Hromkovic, Juraj
    Schnitger, Georg
    INFORMATION AND COMPUTATION, 2010, 208 (08) : 982 - 995
  • [44] ON A CHARACTERIZATION OF PUSHDOWN PERMUTERS
    SHYAMASUNDAR, RK
    THEORETICAL COMPUTER SCIENCE, 1982, 17 (03) : 333 - 341
  • [45] Quantum Pushdown Automata
    Daowen Qiu
    International Journal of Theoretical Physics, 2002, 41 : 1627 - 1639
  • [46] On the complexity of ω-pushdown automata
    Yusi Lei
    Fu Song
    Wanwei Liu
    Min Zhang
    Science China Information Sciences, 2017, 60
  • [47] Pushdown module checking
    Bozzelli, L
    Murano, A
    Peron, A
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2005, 3835 : 504 - 518
  • [48] Fuzzy pushdown automata
    Xing, Hongyan
    FUZZY SETS AND SYSTEMS, 2007, 158 (13) : 1437 - 1449
  • [49] On the complexity of ω-pushdown automata
    Lei, Yusi
    Song, Fu
    Liu, Wanwei
    Zhang, Min
    SCIENCE CHINA-INFORMATION SCIENCES, 2017, 60 (11)
  • [50] Quantum pushdown automata
    Golovkins, M
    SOFSEM 2000: THEORY AND PRACTICE OF INFORMATICS, 2000, 1963 : 336 - 346