Sciweavers

432 search results - page 15 / 87
» On Notions of Regularity for Data Languages
Sort
View
SIGPLAN
2002
13 years 7 months ago
Pattern-matching and rewriting rules for group indexed data structures
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
Jean-Louis Giavitto, Olivier Michel, Julien Cohen
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Temporal Support of Regular Expressions in Sequential Pattern Mining
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
EACL
1989
ACL Anthology
13 years 8 months ago
The Syntactic Regularity Of English Noun Phrases
Approximately, 10,000 naturally occurring noun phrases taken from the LOB corpus were used firstly, to evaluate the NP component of the Alvey ANLT grammar (Grover et al., 1987, 19...
Lita Taylor, Claire Grover, Ted Briscoe
ICDT
2009
ACM
128views Database» more  ICDT 2009»
14 years 8 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani