CS402 - Theory of Automata
Course Page
Q & A
Course Category: Computer Science/Information Technology
Course Level: Imdregraduate
Credit Hours: 3
Pre-requisites: N/A
Languages, Kleen Closure, Recursive Definitions, Regular Expressions, Finite and Infinite languages, Regular Languages, NonRegular Languages, Finite Automata with output, Finite Automata and their languages, Transition Graphs, Nondeterminism, NonRegular Languages, The Pumping Lemma, Context Free Grammars, Tree, Ambiguity, Pushdown Automata, Decidability

Course Instructor

Dr. Shahid Siddiqi
Ph.D. (Computational Mathematics) Brunel University (University of West London), England.
Introduction to Computer Theory by Daniel I. A. Cohen
Introduction to Languages and the Theory of Computation by John C. Martin