Skip to content
0091-484-2540360
[email protected]
Kalamassery, Kochi, Ernakulam
Search for:
TOP MENU
Primary Menu
HOME
ABOUT US
Albertian Institute of Science & Technology
Instructors
Annual Appraisal
Research & Consultancy @ AISAT
ALL COURSES
Departments
AI & ML Courses
ASH Courses
CE Courses
CSE Courses
ECE Courses
EEE Courses
ME Courses
First Year Courses
Applied Science & Humanities Courses
Engineering Chemistry Courses
Engineering Mathematics Courses
Engineering Physics Courses
English Courses
General Courses
General Courses
IIC Orientations
Physical Education Training
Placement Training
Research Orientation
Soft Skill Development
CONTACT US
PROFILE
LOGIN
Main Site
Search for:
Main Site
0091-484-2540360
[email protected]
Kalamassery, Kochi, Ernakulam
Home
All Courses
Theory of Computation
Theory of Computation
Curriculum
4 Sections
49 Lessons
10 Weeks
Expand all sections
Collapse all sections
module1 Foundation and Finite Automata
16
1.1
introducing automata simple models
1.2
Three basic concepts: Alphabet, Strings, and Languages
1.3
Formal definition of a finite automaton
1.4
Deterministic Finite Automata (DFA)
1.5
Regular languages
1.6
nondeterministic finite automaton
1.7
NFA with epsilon transitions
1.8
Equivalence of NFAs and DFAs
1.9
DFA State Minimization
1.10
Operations of regular languages
1.11
NFA example 1
1.12
NFA example 2
1.13
NFA to DFA example 1
1.14
NFA to DFA example 2
1.15
DFA state minimization example
1.16
conversion on Epsilon NFA to NFA
Module 2 Regular Expressions, Properties of Regular language,Context-Free Grammars and Applications
15
2.1
The formal definition of a regular expression
2.2
Regular expression examples
2.3
designing regular expression
2.4
NFA to RE
2.5
DFA to RE
2.6
conversion of RE to FA
2.7
conversion of RE to FA
2.8
Pumping Lemma
2.9
Pumping Lemma example1
2.10
Regular grammar
2.11
Derivations from a Grammar
2.12
CFG and CFL
2.13
Derivation Trees(Left and right derivation trees)
2.14
Ambiguous grammar
2.15
Simplification of CFG
Module 3 PDA and CFL
8
3.1
Formal definition of a pushdown automaton
3.2
Examples of pushdown automata
3.3
Equivalence NPDAs and CFGs
3.4
Elimination of useless symbols and productions
3.5
Eliminating unit productions
3.6
Chomsky normal form
3.7
Greibach normal form
3.8
The Pumping Lemma for Context-Free Languages
Module 4 Turning Machine
10
4.1
Turning machine definition
4.2
Turning machine example
4.3
The church turning thesis
4.4
turning machine for even palindromes
4.5
multitape turning machine
4.6
Decidability and undecidability
4.7
universal turning machine
4.8
halting problem
4.9
undecidability of the halting problem
4.10
undecidability of the post correspondence
This content is protected, please
login
and
enroll
in the course to view this content!
Modal title
Main Content
