O'Reilly logo

Formal Languages and Automata Theory by K.V.N. Sunitha

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

3

Regular Languages and Regular Grammars

  1. Regular Expressions are shorthand notations to describe a language. They are used in many programming languages and Language tools such as lex, vi editor, PHP and PERL. They are used as powerful tool in search engines.

In this chapter we introduce Regular Expression (RE), Regular Sets and representation of regular sets using regular expressions. Operations on regular expressions along with identity rules are described. Equivalence of Finite Automata (FA) and regular expressions & equivalence of Regular expressions and finite automata are explained. Interconversion between regular expression to NFA and DFA to Regular expression using recursive procedure, Arden’s theorem and generalized non-deterministic ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required