[vc_row el_class=”inner-body-content” css=”.vc_custom_1667213684668{padding-top: 30px !important;padding-bottom: 20px !important;}”][vc_column][vc_custom_heading text=”Pre-requisite(s)” font_container=”tag:h2|font_size:20px|text_align:left” use_theme_fonts=”yes” css=”.vc_custom_1667213691721{margin-top: 0px !important;}”][vc_column_text]None[/vc_column_text][vc_custom_heading text=”Recommended Book(s)” font_container=”tag:h2|font_size:20px|text_align:left” use_theme_fonts=”yes”][vc_column_text]Introduction To Computer Theory, 2^nd Edition, Daniel I. A. Cohen, John Wiley & Sons, Inc., 1997, ISBN 0-471-13772-3.[/vc_column_text][vc_custom_heading text=”COURSE OBJECTIVES” use_theme_fonts=”yes”][vc_column_text]

[/vc_column_text][vc_custom_heading text=”COURSE LEARNING OUTCOMES (CLO)” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Course Objectives[/vc_column_text][vc_custom_heading text=”COURSE CONTENTS” use_theme_fonts=”yes”][vc_custom_heading text=”Introduction” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Why this course?
History of computation
Alphabet Sets
Languages in the abstract
Defining a Language
Finite and Infinite Languages
Kleene Closure[/vc_column_text][vc_custom_heading text=”Regular Expressions” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Method to define a language
Formal definition of Regular Expression
Languages associated with Regular Expressions
Ffinite languages are regular
RE for Even-Even[/vc_column_text][vc_custom_heading text=”Finite Automata” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Another method to define language
States, transitions, input symbols
FAs and their Languages
Transition Tables of language
FA of even-even[/vc_column_text][vc_custom_heading text=”Transition Graph” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Relaxing the restrictions on inputs
Generalized transition graphs
Non determinism
Constructing regular expression from TGs
Kleene’s theorem.[/vc_column_text][vc_custom_heading text=”Regular and Nonregular languages” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Closure properties
complements and intersections
pumping lemma[/vc_column_text][vc_custom_heading text=”Finite Automata with Output” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Moore Machines
Mealy Machines
Transducers
Practical Applications of Finite Automata[/vc_column_text][vc_custom_heading text=”Context-Free grammars” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Syntax as a method for defining a language
symbolism for generative grammars
Parse Trees
Ambiguity
Total Language Trees
Leftmost and rightmost derivations
Chomsky’s Normal Form[/vc_column_text][vc_custom_heading text=”Pushdown Automata” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]A new format of FAs
Adding a Pushdown Stack
Deterministic and Non-deterministic PDA
Converting a PDA to CFG and vice versa.[/vc_column_text][vc_custom_heading text=”Non-Context-Free and Context-Free Languages” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Pumping Lemma for CFLs
Closure Properties of CFLs
Intersection and Complement
Decidability of CFLs.[/vc_column_text][vc_custom_heading text=” Turing Machines” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]The Turing Machine
Variations of Turing Machines
Recursive and Recursively Enumerable Languages
Chomsky’s Hierarchy[/vc_column_text][vc_custom_heading text=”MAPPING OF CLOs TO ASSESSMENT MODULES” font_container=”tag:h2|font_size:20px|text_align:left” use_theme_fonts=”yes”][vc_column_text css=”.vc_custom_1667213620046{margin-bottom: 0px !important;}”]

[/vc_column_text][/vc_column][/vc_row]