CS-402 Theory of Automata
Q & A
Online Test
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
 CS402_Handouts  CS402_ Midterms  CS402_Current midterm spring 2016  CS402_Mid_Term_Papers_Subjective_Solved_Questions  CS402_Midterm Paper mcqs  CS402_midterm paper  CS402_midterm paper 2  CS402_Midterm Solved MCQs WithReferences by Moaaz  CS402_Short_Notes_For_Papers  CS402_solved midterm papers  CS402_solved_MCQs  CS402_solved_MCQs_MCQs_2

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