206 search results - page 7 / 42 » Regular Expressions into Finite Automata |
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
HOTI
2008
IEEE
14 years 1 months ago
2008
IEEE
— Recent network intrusion detection systems (NIDS) use regular expressions to represent suspicious or malicious character sequences in packet payloads in a more efficient way. ...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
ICTAC
2009
Springer
14 years 1 months ago
2009
Springer
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...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...