Open Courseware - Virtual University of Pakistan

Home > Courses > Computer Science/Information Technology > CS402

CS402 : Theory of Automata

I like this Course

Course Info
Course Category	Computer Science/Information Technology
Course Level	Undergraduate
Credit Hours	3
Pre-requisites	N/A
Instructor	Dr. Shahid Siddiqi Ph.D. (Computational Mathematics) Brunel University (University of West London), England.

Course Contents
Introduction to Languages and Computer Theory Kleene’s Star Closure Regular Expression Equivalent Regular Expressions Finite Automaton. Equivalent FAs FA corresponding to finite languages Transition Graph Generalized Transition Graphs Nondeterminism and Kleene’s Theorem Kleene’s Theorem Part II Kleene’s Theorem Part III Kleene’s Theorem Part III (Continue) Kleene’s Theorem Part III (Continue) Nondeterministic Finite Automaton (NFA) NFA with Null String NFA and Kleene’s Theorem NFA corresponding to Concatenation of FAs Distinguishable strings and Indistinguishable strings Moore machine Mealy machine Equivalent machines Finite Automata with Output Regular languages and Complement of a language Nonregular languages Pumping Lemma Pumping Lemma version II Pseudo theorem Decidability Determining whether the two languages are equivalent or not ? Context Free Grammar (CFG) Trees Polish Notation (o-o-o) Regular Grammar Null Production Chomsky Normal Form (CNF) A new format for FAs Nondeterministic PDA PDA corresponding to CFG Conversion form of PDA Conversion form of PDA (Continued) Conversion form of PDA (Continue) Non-Context-Free language and Pumping lemma for CFLs Decidability and Parsing Techniques Turing machine