Formal Languages and Automata PPT SLIDES

Formal Languages and Automata

Instructor: T.K  prasad
Textbook:Thomas A. Sudkamp: Languages and Machines, 3rd Edition, Addison-Wesley,
Download Slides from here

Introduction; Recursive Definitions

Proof by Induction; Strings and Languages

(cont'd)

Regular Sets and Expressions

Context-Free Grammars

Examples

Application

Proofs by Induction

Parsing  (only if time permits)

Transforming CFGs

Normal Forms

Finite State Automaton

Closure Properties

Nonregularity; Pumping Lemma

Examples of Nonregularity Proofs

Lambda Transitions and their removal; DFA Minimization

FSA/Regular Sets/Grammars