61 search results - page 3 / 13 » Embedding Finite Automata within regular Expressions |
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
LATIN
1992
Springer
13 years 11 months ago
1992
Springer
DLT
2008
13 years 9 months ago
2008
DLT
2009
13 years 5 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
IJAC
2007
13 years 7 months ago
2007
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...