263 search results - page 14 / 53 » Rigid Tree Automata |
88
Voted
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
143
click to vote
ACL
1996
15 years 3 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
124
Voted
FSTTCS
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
116
click to vote
PLANX
2008
15 years 3 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
106
click to vote
ICALP
2009
Springer
16 years 2 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...