Scribd
Upload
105 views1 page

Theory of Computation Course Structure

This document outlines the course structure for a Theory of Computation course. The course covers formal languages, grammars, automata, regular expressions, context-free grammars, pushdown automata, Turing machines, context-sensitive languages, and issues of decidability. It is divided into six sections that cover finite automata and regular languages, regular expressions, grammars and Chomskyan hierarchy, Turing machines, context-sensitive languages, and topics on undecidability.

Uploaded by

raja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
105 views1 page

Theory of Computation Course Structure

This document outlines the course structure for a Theory of Computation course. The course covers formal languages, grammars, automata, regular expressions, context-free grammars, pushdown automata, Turing machines, context-sensitive languages, and issues of decidability. It is divided into six sections that cover finite automata and regular languages, regular expressions, grammars and Chomskyan hierarchy, Turing machines, context-sensitive languages, and topics on undecidability.

Uploaded by

raja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

THEORY OF COMPUTATION

COURSE STRUCTURE
1. Introduction to TOC/FLAT : Basics and definition
of terms used in TOC (Formal Language , Grammar ,
Automata , its types , alphabet , Strings and
closures.)
2. Regular Language and Finite Automata : its
representation , Block diagram , construction of
MFA , complement of FA , compound Automata , NFA
, ε-NFA , conversion of NFA to DFA , ε-NFA – NFA
, ε-NFA – DFA , Optimization of FA and Decision
property of FA.
3. Regular expression : Equivalence between RE & FA ,
Algebraic property of RE , Closure property of RL
, Pumping lemma and Finite Automata with Output.
4. Grammar and Chousky hierarchy : Regular grammar
and types , conversion of RG to Finite Automata ,
Context free grammar , Normal form : CNF & GNF ,
Decision property of CFG , PDA & block diagram ,
Acceptance by PDA , closure property of DCFL/CFL
,conversion of CFG to PDA , Pumping lemma for CFL
, Weak form of PL.
5. Turing Machine : Introduction , ID for turing
machines , transition diagram for turing machine ,
(Block diagram) , Acceptance by TM , Turing
machines as Transducer , Turing machine as
enumerator system , Recursive set and Recursive
enumerator set , Closure property of RS / RES.
6. Context Sensitive Language , LBA , Closure Property
of CSL Undecidability , Enumerating the Binary
String , The Diagonalization language , An
Undecidable problem of RE , Complements of
Recursive and RE Language , The Universal Language
and its Undecidability.

You might also like