Sciweavers

759 search results - page 25 / 152
» Overlap-Free Regular Languages
Sort
View
DATE
2008
IEEE
182views Hardware» more  DATE 2008»
14 years 2 months ago
An adaptable FPGA-based System for Regular Expression Matching
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
Ivano Bonesana, Marco Paolieri, Marco D. Santambro...
LICS
2010
IEEE
13 years 6 months ago
Regular Cost Functions over Finite Trees
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
Thomas Colcombet, Christof Löding
DBPL
2005
Springer
135views Database» more  DBPL 2005»
14 years 2 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
ICTCS
2005
Springer
14 years 2 months ago
Error Mining for Regular Expression Patterns
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
Giuseppe Castagna, Dario Colazzo, Alain Frisch
PAAMS
2010
Springer
13 years 6 months ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...