Visit: https://a2zcareers.viden.io
CS1013 THEORY OF COMPUTATION
UNIT I - FINITE AUTOMATA (9 hours)
Introduction- Basic Mathematical Notation and techniques- Finite State systems –Basic Definitions – Finite Automaton – DFA & NDFA – Finite Automaton with €-moves – Regular Languages- Regular Expression ...See more
– Equivalence of NFA and DFA – Equivalence of NDFA’s with and without €-moves – Equivalence of finite Automaton and regular expressions –Minimization of DFA- - Pumping Lemma for Regular sets – Problems based on Pumping Lemma.
Views: 4581
Added: 4 years ago
UNIT-1 TOC-TNM.ppt
Download
Suggested Creators
Answer the Question