Visibly Pushdown Transducers with Well-Nested Outputs - Archive ouverte HAL
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2016

Visibly Pushdown Transducers with Well-Nested Outputs

Résumé

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced oto 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 outputs to be decidable in PTIME. Moreover, we show that this class is closed under composition and that its type-checking against visibly pushdown languages is decidable.

Dates et versions

hal-03542594 , version 1 (25-01-2022)

Identifiants

Citer

Pierre-Alain Reynier, Jean-Marc Talbot. Visibly Pushdown Transducers with Well-Nested Outputs. International Journal of Foundations of Computer Science, 2016, 27 (02), pp.235-257. ⟨10.1142/S0129054116400086⟩. ⟨hal-03542594⟩
16 Consultations
0 Téléchargements

Altmetric

Partager

More