1000 search results - page 19 / 200 » Dependency Tree Automata |
121
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
125
Voted
SSPR
2000
Springer
15 years 7 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...
139
Voted
ALT
2010
Springer
15 years 10 days 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...
125
click to vote
ICALP
2000
Springer
15 years 7 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...
143
Voted
ASWEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...