581 search results - page 11 / 117 » An Automata Model for Trees with Ordered Data Values |
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
187
click to vote
PKDD
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In many applications of data mining a - sometimes considerable - part of the data values is missing. This may occur because the data values were simply never entered into...
156
click to vote
ICALP
2007
Springer
16 years 3 days ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
143
click to vote
ATVA
2006
Springer
15 years 9 months ago
2006
Springer
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
162
click to vote
ICGI
1998
Springer
15 years 10 months ago
1998
Springer
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...