581 search results - page 4 / 117 » An Automata Model for Trees with Ordered Data Values |
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
84
Voted
IS
2010
14 years 8 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
CAV
2004
Springer
15 years 1 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...