263 search results - page 15 / 53 » Rigid Tree Automata |
159
click to vote
FOSSACS
2009
Springer
16 years 21 days ago
2009
Springer
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 d...
151
click to vote
SSPR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
168
click to vote
IFM
2007
Springer
16 years 1 days ago
2007
Springer
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
166
click to vote
ALT
2010
Springer
15 years 2 months ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
158
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...