Course Contents
The subject deals with the basic terminologies, notations and techniques of Computer Theory, which are pre-requisites for Computer Design, Artificial Intelligence, the Analysis of Algorithms and so forth. The key objective is to recognize and manipulate context free grammars and to understand the power of recursive interaction of parts of a procedure.
Course Synopsis
• Understand mathematical models of computation.
• Be able to reason formally about mathematical models.
Course Learning Outcomes
• Build a regular expression, deterministic finite automaton and non-deterministic finite automaton for a regular language.
• Build a pushdown automaton or context-free grammar for a context-free language.
• Build a Turing machine.
PDA for regular languages
View Now
Example of a PDA, Non deterministic PDA
View Now
PDA for corresponding CFG
View Now
CFG corresponding to a PDA
View Now
Context Free Languages
View Now
Closure properties of context free language Part 1
View Now
Closure properties of context free language Part 2
View Now
Turing Machine Part 1
View Now
Turing Machine Part 2
View Now
Example of a Turing Machine
View Now
Post Machine
View Now
Transition Graphs-1
View Now
Introduction Languages, Defining languages
View Now
Regular Expressions Formal Definitions of Languages
View Now
Regular Expressions, EVEN – EVEN
View Now
FAs and their Languages-1
View Now
FAs and their Languages-2
View Now
FAs and their Languages-3
View Now
FAs and their Languages-4
View Now
Transition Graphs-2
View Now
Generalized Transition Graphs, Kleene’s Theorem, Proof of Kleene’s Theorem Part 1
View Now
Proof of Kleene’s Theorem Part 2
View Now
Proof of Kleene’s Theorem Part 3
View Now
Proof of Kleene’s Theorem Part 3 (contd)
View Now
Proof of Kleene’s Theorem Part 3 Examples
View Now
Non deterministic Finite Automata
View Now
NFA to DFA conversion
View Now
NFAs and Kleene’s Theorem -1
View Now
NFAs and Kleene’s Theorem -2
View Now
Turing Machine Part 2
View Now
NFAs and Kleene’s Theorem -3
View Now
Finite Automata with Output Moore Machines
View Now
Mealy Machines
View Now
Moore = Mealy
View Now
Transducers as Models of Sequential Circuits
View Now
Regular Languages, Closure Properties, Complements
View Now
Intersections
View Now
Context Free Grammars Theory
View Now
Context Free Grammars
View Now
Trees for Grammars
View Now
Ambiguity, Total Language Tree
View Now
Grammatical Format, Regular Grammars, Killing Null Productions, Killing Unit Productions, Chomsky Normal Form, Leftmost Derivations
View Now
Chomsky Normal Form, Leftmost Derivations
View Now
Example of a Turing Machine
View Now
Post Machine
View Now
Book Title : Computer Theory
Author : I. A. Cohen
Edition :
Publisher :
Book Title : Introduction to Automata Theory, Languages and Computation
Author : Hop Croft
Edition :
Publisher :
Book Title : The Language and its Implementations
Author : Darror & D.W
Edition :
Publisher :
Book Title : An Introduction to Formal Languages and Automata
Author : Peter Linz
Edition : 4th edition
Publisher : Jones & Bartlett Publishers
Book Title : Theory of Automata, Formal Languages and Computation
Author : S. P. Eugene, Kavier
Edition :
Publisher : New Age Publishers
Book Title : Introduction to Automata Theory, Languages, and Computation
Author : John Hopcroft and Jeffrey Ullman
Edition : 2nd edition
Publisher : Addison-Wesley
Book Title : Introduction to Languages and the Theory of Computation
Author : John C. Martin
Edition : 3rd edition
Publisher : McGraw-Hill Professional
No Information Yet