Theory Of Computation (2160704)

BE | Semester-7   Winter-2018 | 27/11/2018

Q5) (b)

What are the applications of regular expressions and finite automata?

Application Of Regular Expression

  1. Regular expressions are useful in a wide variety of text processing tasks, and more generally string processing, where the data need not be textual.
  2. Common applications include
    1. Data Validation
    2. Data Scraping (especially web scraping)
    3. data wrangling
    4. simple parsing
    5. the production of syntax highlighting systems

Applications Of Finite Automata (FA)

  1. Lexical analysis phase of a compiler.
  2. Design of digital circuit.
  3. String matching.
  4. Communication Protocol for information exchange.