234 search results - page 26 / 47 » On Quasi-Products of Tree Automata |
122
click to vote
ADBIS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
FOSSACS
2001
Springer
15 years 5 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
104
click to vote
ESOP
2009
Springer
15 years 5 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
127
click to vote
ICDT
2012
ACM
13 years 3 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
134
click to vote
SIGCSE
1997
ACM
15 years 5 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...