ANNA UNIVERSITY :: CHENNAI 600 025

Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA)– Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions. UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9 ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download