234 search results - page 11 / 47 » On Quasi-Products of Tree Automata |
116
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
142
click to vote
IWPT
2001
15 years 2 months ago
2001
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
100
click to vote
ICALP
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
112
click to vote
NAACL
2001
15 years 2 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
121
click to vote
CAV
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...