TOC-UNIT II
Unit-II Regular Languages and Finite Automata Regular Expressions, Regular Languages, Application of Finite Automata, Automata with output- Moore machine & Mealy machine, Finite Automata, Memory requirement in a recognizer, Definitions, union- intersection and complement of regular languages, Non Deterministic Finite Automata, Conversion from NFA to FA, ??- Non Deterministic Finite Automata, Conversion of NFA- ? to NFA, Kleene’s Theorem, Minimization of Finite automata, Regular And Non Regular Languages– pumping lemma. 2.1)REGULAR EXPRESSIONS · A Regular Expression (RE) is a symbolic notation used to describe patterns in strings over an alphabet. It is used to define Regular Languages. · A regular expression is basically a shorthand way of showing how a regular language is built from the base set of regular languages. · The symbols are identical which are used to construct ...