Sciweavers

500 search results - page 21 / 100
» Streaming tree automata
Sort
View
CSL
2006
Springer
13 years 7 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
WIA
2007
Springer
14 years 1 months ago
Backward and Forward Bisimulation Minimisation of Tree Automata
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
Johanna Högberg, Andreas Maletti, Jonathan Ma...
CIKM
2008
Springer
13 years 9 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
CAV
2004
Springer
152views Hardware» more  CAV 2004»
14 years 1 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
LACL
1998
Springer
13 years 11 months ago
Lambek Calculus Proofs and Tree Automata
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
Hans-Jörg Tiede