Scribd
Upload
103 views

TCS

This document outlines the syllabus for a Theory of Computer Science course. It covers the following topics in 3 sentences or less each: - Introduction to finite automata, regular expressions, regular grammars, and proving languages are non-regular using pumping lemmas. - Context-free grammars, parsing, ambiguity, normalization of CFGs, proving languages are not context-free using pumping lemmas for CFLs, and closure properties of CFLs. - Pushdown automata, equivalence with CFGs, deterministic pushdown automata and their relationships to regular and context-free languages, Turing machines and their variants and computing power, and the Chomsky hierarchy.

Uploaded by

'Nimesh' Shah
Copyright
© Attribution Non-Commercial (BY-NC)
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
103 views

TCS

This document outlines the syllabus for a Theory of Computer Science course. It covers the following topics in 3 sentences or less each: - Introduction to finite automata, regular expressions, regular grammars, and proving languages are non-regular using pumping lemmas. - Context-free grammars, parsing, ambiguity, normalization of CFGs, proving languages are not context-free using pumping lemmas for CFLs, and closure properties of CFLs. - Pushdown automata, equivalence with CFGs, deterministic pushdown automata and their relationships to regular and context-free languages, Turing machines and their variants and computing power, and the Chomsky hierarchy.

Uploaded by

'Nimesh' Shah
Copyright
© Attribution Non-Commercial (BY-NC)
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

Vidyalankar

T.E. Sem.V [CMPN]

Theory of Computer Science


SYLLABUS
Time : 3 Hrs. Theory : 100 Marks Term Work : 25 Marks

1.

Introduction : alphabets, Strings and Languages, automata and Grammars. Finite Automata (FA) its behavior; DFA Formal definition, simplified notations (state transition diagram, transition table), Language of a DFA. NFAFormal definition, Language of an NFA. An Application : Text Search, FA with epsilontransitions, Eliminating epsilontransitions, Eliminating epsilontransitions, Equivalence of DFAs and NFAs. Regular expressions (RE) Definition, FA and RE, RE to FA, FA to RE, algebraic laws for RE, applications of REs, Regular grammars and FA, FA for regular grammar, Regular grammar for FA. Proving languages to be nonregular Pumping Lemma, and its applications. Some closure properties of Regular languages Closure under Boolean operations, reversal homomorphism, inverse homomorphism, etc. M hillNerode Theorem. DFA Minimization Some decision properties of Regular languages emptiness, finiteness, membership, equivalence of two DFAs or REs, Finite automata with output. Contextfree Grammars (CFGs) Formal definition, sentential forms, leftmost and rightmost derivations, the language of a CFG. Derivation tree or Parse treeDefinition, Relationship between parse trees and derivations. Parsing and ambiguity, Applications of CFGs, Ambiguity in grammars and Languages. Simplification of CFGs Removing useless symbols, epsilonProductions, and unit productions, Normal forms CNF and GNF. Proving that some languages are not context free Pumping lemma for CFLs, applications. Some closure properties of CFLs Closure under union, concatenation, Kleene closure, substitution, Inverse homomorphism, reversal, intersection with regular set, etc. Some more decision properties of CFLs, Review of some undecidable CFL problems. Pushdown Automata (PDA) Formal definition, behavior and graphical notation, Instantaneous descriptions (Ids), The language of PDA (acceptance by final state and empty stack). Equivalence of acceptance by final state and empty stack, Equivalence of PDAs and CFGs, CFG to PDA, PDA to CFG. DPDAs Definition, DPDAs and Regular Languages, DPDAs, Multistack DPDAs & NPDAs and CFLs. Languages of DPDAs, NPDAs, and ambiguous grammars. Turing Machines TM Formal definition and behavior, Transition diagrams, Language of a TM, TM as accepters deciding and generators. TM as a computer of integer functions, Design of TMs, Programming techniques for TMs Storage in state, multiple tracks, subroutines, etc. Universal TMs, Variants of TMs Multitape TMs, Nondeterministic TMs. TMs with semiinfinite tapes, Multistack machines, Simulating TM by computer, Simulating a Computer by a TM, Equivalence of the various variants with the basic model. Recursive and recursively enumerable languages, Properties of recursive and recursively enumerable languages, A language that is non recursively enumerably (the diagonalization language). The universal language, Undecidability of the universal language, The Halting problem, Rices Theorem, Greibach Theorem, Posts Correspondence Problem (PCP) Definition, Undecidability of PCP. Context sensitive language and linear bounded automata. Chomsky hierarchy. Intractable Problems : The classes P and NP, an NPcomplete problem, A Restricted Satisfiability problem, Additional NPcomplete problems, Complements of languages in NP, Problems Solvable in polynomial space, A problem that is complete for PS, Language Classes based on randomization, The complexity of primality testing.

2.

3.

4.

5.

6.

7.

8.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy