Geodesic
Cardinality estimates for some classes of regular languages
Diskretnaya Matematika, Tome 27 (2015) no. 2, pp. 3-21.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a method that modifies regular expressions in order to solve the “exponential explosion” problem on the number of states of the finite automaton that recognizes a set of regular languages defined by the union of regular expressions of the form $.{*}$R$_1.{*}$R$_2.{*}$, where R$_1$ and R$_2$ are arbitrary regular expressions. We estimate the growth functions of regular languages from a subclass of the described class of regular languages and propose a method for estimation of relative growth of the number of words for the modification of a language defined by a pair of regular expressions. We also analyse practical efficiency of the proposed modification method and estimation method for the case of regular expressions from the system Snort.
Keywords: finite automata, regular expressions, intrusion detection systems. 
@article{DM_2015_27_2_a0,
     author = {D. E. Alexandrov},
     title = {Cardinality estimates for some classes of regular languages},
     journal = {Diskretnaya Matematika},
     pages = {3--21},
     publisher = {mathdoc},
     volume = {27},
     number = {2},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2015_27_2_a0/}
}
TY  - JOUR
AU  - D. E. Alexandrov
TI  - Cardinality estimates for some classes of regular languages
JO  - Diskretnaya Matematika
PY  - 2015
SP  - 3
EP  - 21
VL  - 27
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2015_27_2_a0/
LA  - ru
ID  - DM_2015_27_2_a0
ER  - 
%0 Journal Article
%A D. E. Alexandrov
%T Cardinality estimates for some classes of regular languages
%J Diskretnaya Matematika
%D 2015
%P 3-21
%V 27
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2015_27_2_a0/
%G ru
%F DM_2015_27_2_a0
D. E. Alexandrov. Cardinality estimates for some classes of regular languages. Diskretnaya Matematika, Tome 27 (2015) no. 2, pp. 3-21. http://geodesic.mathdoc.fr/item/DM_2015_27_2_a0/

[1] Dokumentatsiya sistemy Snort {http://www.snort.org/documents}

[2] Dokumentatsiya sistemy Bro {http://www.bro.org/}

[3] Opisanie sistemy L7-filter {http://l7-filter.sourceforge.net/README}

[4] Stranitsa apparatnykh produktov kompanii Cisco {http://www.cisco.com/c/en/us/ products/security/intrusion-prevention-system-ips}

[5] Kumar S., Dharmapurikar S., Yu F., Crowley P., Turner J., “Algorithms to accelerate multiple regular expressions matching for deep packet inspection”, ACM SIGCOMM Computer Communication Review, 36:4 (200), 339–350, ACM | DOI

[6] Aho A. V., Corasick M. J., “Efficient string matching: an aid to bibliographic search”, Communications of the ACM, 18:6 (1975), 333–340, ACM | DOI

[7] Liu C., Wu J., “Fast Deep Packet Inspection with a Dual Finite Automata”, Computers, IEEE Transactions on, 62:2 (2013), 310–321, IEEE | DOI

[8] Kumar S., Chandrasekaran B., Turner J., Varghese G., “Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia”, Proc. 3rd ACM/IEEE Symp. on Architecture for networking and communications systems, ACM, 2007, 155–164 | DOI

[9] Smith R., Estan C., Jha S., Kong S., “Deflating the big bang: fast and scalable deep packet inspection with extended finite automata”, ACM SIGCOMM Computer Communication Review, 38:4 (2008), 207–218, ACM | DOI

[10] Yu F., Chen Z., Diao Y., Lakshman T. V., Katz R. H., “Fast and memory-efficient regular expression matching for deep packet inspection”, Proc. of the 2006 ACM/IEEE symp. on Architecture for networking and communications systems, ACM, 2006, 93–102

[11] Aleksandrov D. E., “Ob umenshenii avtomatnoi slozhnosti za schet rasshireniya regulyarnykh yazykov”, Programmnaya inzheneriya, 2014, no. 11, 26–34, Novye tekhnologii

[12] Aleksandrov D. E., “Ob otsenkakh avtomatnoi slozhnosti raspoznavaniya klassa regulyarnykh yazykov”, Intellektualnye sistemy, 18:4 (2014), 121–146

[13] Dokumentatsiya regulyarnykh vyrazhenii PCRE {http://www.pcre.org/pcre.txt}

[14] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, Moskva, 1985

[15] Martin J. C., Introduction to Languages and the Theory of Computation, 4, McGraw-Hill, New York, 2011

[16] {Baza signatur sistemy Snort} {http://www.snort.org/snort-rules/}