Visibly pushdown transducers
作者：
Highlights：
• We introduce the class of Visibly Pushdown Transducers (VPT).
• VPT model transformations from nested words to words.
• VPT have good algorithmic properties (e.g. decidable functional equivalence).
• VPT are closed by regular look-ahead.
• Well-nested VPT, as subclass of VPT, have decidable type-checking problem.
摘要
•We introduce the class of Visibly Pushdown Transducers (VPT).•VPT model transformations from nested words to words.•VPT have good algorithmic properties (e.g. decidable functional equivalence).•VPT are closed by regular look-ahead.•Well-nested VPT, as subclass of VPT, have decidable type-checking problem.
论文关键词：Visibly pushdown automata,Transducers,Functionality
论文评审过程：Received 21 August 2014, Revised 9 March 2016, Accepted 30 May 2018, Available online 5 July 2018, Version of Record 13 August 2018.
论文官网地址：https://doi.org/10.1016/j.jcss.2018.05.002
