Reversible pushdown transducers
نویسندگان
چکیده
Deterministic pushdown transducers are studied with respect to their ability compute reversible transductions, that is, transform inputs into outputs in a way. This means the also backward deterministic and thus able uniquely step computation back forth. The families of transductions computed classified regard four types length-preserving as well property working reversibly. It turns out accurate one case separating witness can be provided. For remaining it is possible establish equivalence both by proving stationary moves always removed transductions.
منابع مشابه
Self-reproducing pushdown transducers
After a translation of an input string, x, to an output string, r/, a self-reproducing pushdown transducer can make a self-reproducing step during which it moves y to its input tape and translates it again. In this self-reproducing way, it can repeat the translation ntimes for any n > 1. This paper demonstrates that every recursively enumerable language can be characterized by the domain of the...
متن کاملExpressiveness of Visibly Pushdown Transducers
Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. As trees and more generally hedges can be linearized into (well) nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. This paper aims at characterizing p...
متن کاملProperties of Visibly Pushdown Transducers
Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. In this paper, we prove that functionality is decidable in PSPACE for visibly pushdown transducers. The proof is done via a pumping argument: if a word with two outputs has a sufficie...
متن کاملWeighted Pushdown Systems and Weighted Transducers
Pushdown Systems (PDSs) are an important formalism for modeling programs. Reachability analysis on PDSs has been used extensively for program verification. A key result, which made PDSs popular in the model-checking community was that the set of reachable stack configurations starting from a regular set of configurations is also regular. A more general result was given by Caucal [7] who showed ...
متن کاملVisibly Pushdown Transducers with Well-Nested Outputs
Abstract. Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. When outputs are also structured and well nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. We prove the class of VPTs with well-nested outp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information & Computation
سال: 2021
ISSN: ['0890-5401', '1090-2651']
DOI: https://doi.org/10.1016/j.ic.2021.104813