Sciweavers

2409 search results - page 13 / 482
» On Extended Regular Expressions
Sort
View
ICALP
2000
Springer
15 years 1 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
RAID
2009
Springer
15 years 4 months ago
Regular Expression Matching on Graphics Hardware for Intrusion Detection
The expressive power of regular expressions has been often exploited in network intrusion detection systems, virus scanners, and spam filtering applications. However, the flexibl...
Giorgos Vasiliadis, Michalis Polychronakis, Spyros...
CORR
2008
Springer
93views Education» more  CORR 2008»
14 years 9 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
89
Voted
WWW
2005
ACM
15 years 10 months ago
Expressiveness of XSDs: from practice to theory, there and back again
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Sc...
ARC
2007
Springer
115views Hardware» more  ARC 2007»
15 years 3 months ago
Synthesis of Regular Expressions Targeting FPGAs: Current Status and Open Issues
This paper presents an overview regarding the synthesis of regular expressions targeting FPGAs. It describes current solutions and a number of open issues. Implementation of regula...
João Bispo, Ioannis Sourdis, João M....