An Efficient Regular Expression Pattern Matching Using Stride Finite Automata
Krishna Kishore Thota1, R. JebersonRetna Raj2
1Krishna Kishore Thota, Department of Computer Science Engineering, Sathyabama Institute of Science and Technology, Chennai (Tamil Nadu), India.
2Dr. R. Jeberson Retna Raj, Associate Professor, Department of Information Technology, Sathyabama Institute of Science and Technology, Chennai (Tamil Nadu), India.
Manuscript received on 18 August 2019 | Revised Manuscript received on 29 August 2019 | Manuscript Published on 06 September 2019 | PP: 1050-1054 | Volume-8 Issue- 6S, August 2019 | Retrieval Number: F12000886S19/19©BEIESP | DOI: 10.35940/ijeat.F1200.0886S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Example coordinating assumes a key job in different parcel payload identification applications, for example, interruption location, which is utilized in distinguishing the malware content in system frameworks. Various calculations and instruments have been created to improve reality complexities of distinguishing regex principles and subsequently empower profound bundle review at line rate. In this paper, a novel quickening plan is introduced to determine speed and space wasteful aspects of the customary automata and the DFA called multi-walk Finite automata that confirms more than one byte that expands the general execution of not just design matching but additionally string coordinating.
Keywords: Malware Identification, Pattern Matching, Regular Expression.
Scope of the Article: Patterns and Frameworks