1000 search results - page 42 / 200 » Dependency Tree Automata |
WOLLIC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
104
click to vote
ADBIS
2004
Springer
15 years 5 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 4 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...
COORDINATION
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Reo is a channel-based coordination model whose operational semantics is given by Constraint Automata (CA). Quantitative Constraint Automata extend CA (and hence, Reo) wi...
ESOP
2009
Springer
15 years 3 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...