A Review Paper on Finite Automata Application in String Identification

EasyChair Preprint no. 7691

Abstract

Automata Theory is very useful in programming languages. It can have various applications. One of its applications is for the evaluation of regular expressions. In this paper, the discussion of pattern matching is done. The given input will be searched for the pattern. This proposed model will give the information about the content of the given input string. This concept need a complicated programming model,. Many techniques are present for the process of pattern matching. Finite Automata can be used in the pattern matching process to identify the patterns. It can also be used for making memory efficient by minimizing the number of states, minimize the number of transitions.

Keyphrases: automata, C++, finite, pattern matching machine

@Booklet{EasyChair:7691,
  author = {Harsh Gujar and Karan Gawli and Vivek Ingle and Shubham Deokate and Yash Chungade},
  title = {A Review Paper on Finite Automata Application in String Identification},
  howpublished = {EasyChair Preprint no. 7691},

  year = {EasyChair, 2022}}