Sciweavers

662 search results - page 123 / 133
» Trees, Automata and XML
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 5 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
ICALP
2010
Springer
15 years 4 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
LATA
2009
Springer
15 years 6 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
RTA
2007
Springer
15 years 5 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
SAFECOMP
2007
Springer
15 years 5 months ago
Modeling and Automatic Failure Analysis of Safety-Critical Systems Using Extended Safecharts
With the rapid progress in science and technology, we find ubiquitous use of safety-critical systems in avionics, consumer electronics, and medical instruments. In such systems, u...
Yean-Ru Chen, Pao-Ann Hsiung, Sao-Jie Chen