Sciweavers

Share
FOSSACS
2009
Springer

Dependency Tree Automata

9 years 1 months ago
Dependency Tree Automata
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are defined, nondeterministic and alternating. We show that the nondeterministic automata have a decidable nonemptiness problem and leave as an open question whether this is true for the alternating version. The families of trees that both kinds recognise are closed under intersection and union. To illustrate the utility of the automata, we apply them to terms of simply typed lambda calculus and provide an automata-theoretic characterisation of solutions to the higher-order matching problem.
Colin Stirling
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where FOSSACS
Authors Colin Stirling
Comments (0)
books