Tree automaton

Known as: Nondeterministic finite tree automaton, Nondeterministic tree automaton, DFTA

A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

Recent advances in the model checking of recursion schemes have opened the prospect of a model checking approach to the…

2007

Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder…

2006

Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This…

2005

How to efficiently evaluate massive XPaths set over an XML stream is a fundamental problem in applications of the data stream…

2001

This paper describes an approach to engineering efficient model checkers that are generic with respect to the temporal logic in…

1999

Context-free grammars and tree automata, because they are required to be nite, are limited to deening sets of trees in which the…

1992

1989

A linguistic paradigm of design is assumed. The hierarchical structure afforded by linguistic systems, together with interelement…

1987

Waveforms may be represented symbolically such that their underlying, global structural composition is emphasized. One such…

1983