A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Edit languages for information trees
2013
Electronic Communications of the EASST
We consider a simple set of edit operations for unordered, edge-labeled trees, called information trees by Dal Zilio et al in "A Logic You Can Count On". We define tree languages using the sheaves automata from Foster et al's "A Logic Your Typechecker Can Count On" which in turn are based on Dal Zilio et al and provide an algorithm for deciding whether a complex edit preserves membership in a tree language. This allows us to view sheaves automata and subsets of tree edits as edit languages in
doi:10.14279/tuj.eceasst.57.872
dblp:journals/eceasst/00010W13
fatcat:jfraqg3sybay5mnm3lvr44azr4