Determinacy and rewriting of functional top-down and MSO tree transformations

详细信息    查看全文

• 作者：M. Benedikt^a ; ^{michael.benedikt@cs.ox.ac.uk} ; J. Engelfriet^b ; ^{j.engelfriet@liacs.leidenuniv.nl} ; S. Maneth^c ; ^{smaneth@inf.ed.ac.uk}
• 关键词：View&ndash ; query determinacy ; Top&ndash ; down tree transducers ; MSO definable tree transducers
• 刊名：Journal of Computer and System Sciences
• 出版年：2017
• 出版时间：May 2017
• 年：2017
• 卷：85
• 期：Complete
• 页码：57-73
• 全文大小：577 K
• 卷排序：85

文摘

Decidability of view–query determinacy is proven for large classes of views and queries given by tree transducers. If the query is determined by the view, then we can construct a function that realizes the query on the output of the view. View–query determinacy is a strong static property.