HIGHLIGHTS
- who: Gabriele Puppis and collaborators from the Slawomir StaworkoBounded repairability for regular tree languages15th International Conference Database Theory, ICDT, Mar, Berlin, Germany. University of Oxford, UK have published the paper: Bounded repairability for regular tree languages, in the Journal: (JOURNAL)
- what: The authors consider the problem of repairing unranked trees (e_g documents) satisfying given restriction specification R (e_g DTD) into unranked trees satisfying given target specification T Specifically the authors focus the question of whether one can get from any tree in regular language R to some tree in another regular language T with finite . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.