500 search results - page 14 / 100 » Streaming tree automata |
132
click to vote
NAACL
2001
15 years 4 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...
143
Voted
CAV
2004
Springer
15 years 7 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...
129
click to vote
DLT
2008
15 years 4 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
147
Voted
IANDC
2011
14 years 10 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
106
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...