April 2015
Intermediate to advanced
482 pages
11h 42m
English
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 ...
Read now
Unlock full access