Toggle navigation
About us
Courses
Contact us
Courses
Computer Science and Engineering
Theory of Automata and Formal Languages (Web)
Syllabus
Co-ordinated by :
IIT Guwahati
Available from :
2009-12-31
Lec :
1
Modules / Lectures
Introduction
Alphabets, Strings and languages
Automata and Grammars
Finite Automata
Finite Automata
Removing Transition
Nondeterministic Finite Automata (NFA)
Regular Expressions (RE)
Regular Expression
Regular Grammars
Pumping Lenma
Pumping Lenma-Description
DFA Minimization
Minimization of Deterministic Finite Automata
Some decision properties of Regular Languages
Context-free Grammars
Description-Context-free Grammars
Pushdown Automata
Formal Definition ,behavior -PDA
Equivalence of PDAs and CFGs
PDAs and CFGs
Deterministic PDA
Description-Deterministic PDA
Description-DPDA and DCFLs
Simplification of CFG
Description-Simplification of CFG
Context Free Language(CFL)
Description-Context Free Language(CFL)
Description- Closure Property of CFLs
Description-Decision Algorithms for CFLs
Turing Machines
Description-Turing Machines
Recursively Enumerable Language
Description-Recursively Enumerable Language
Posts Correspondence Problem (PCP)
Description- Post's Correspondence Problem (PCP)
Context Sensitive Language
Description-Chomsky Hierarchy
Web Content
loading...
Module Name
Download