Symbolic Tree Transducers [chapter]

Margus Veanes, Nikolaj Bjørner
2012 Lecture Notes in Computer Science  
Symbolic transducers are useful in the context of web security as they form the foundation for sanitization of potentially malicious data. We define Symbolic Tree Transducers as a generalization of Regular Transducers as finite state input-output tree automata with logical constraints over a parametric background theory. We examine key closure properties of Symbolic Tree Transducers and we develop a composition algorithm and an equivalence decision procedure for linear single-valued
more » ... Preliminaries We use basic notions from classical automata theory [20] , classical logic, and model theory [18] . Our notions regarding tree transducers are consistent with [15] . For finite state (string) transducers a brief introduction is given in [36] .
doi:10.1007/978-3-642-29709-0_32 fatcat:yzsxuw5yd5bnbocfqwycsyuewq