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

J. Comput. Syst. Sci., Volume 85, Issue C, 2017, Pages 57-73.

Cited by: 2|Bibtex|Views7|Links
EI

Abstract:

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. A query is determined by a view, if the result of t...More

Code:

Data:

Your rating :
0

 

Tags
Comments