Sciweavers

22 search results - page 1 / 5
» Regular Expressions with Numerical Constraints and Automata ...
Sort
View
ICTAC
2009
Springer
13 years 11 months ago
Regular Expressions with Numerical Constraints and Automata with Counters
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
Dag Hovland
HOTI
2008
IEEE
13 years 11 months ago
Constraint Repetition Inspection for Regular Expression on FPGA
— Recent network intrusion detection systems (NIDS) use regular expressions to represent suspicious or malicious character sequences in packet payloads in a more efficient way. ...
Miad Faezipour, Mehrdad Nourani
AAAI
2007
13 years 7 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
VLSISP
2008
140views more  VLSISP 2008»
13 years 4 months ago
Regular Expression Matching in Reconfigurable Hardware
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
Ioannis Sourdis, João Bispo, João M....
RTA
2000
Springer
13 years 8 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren