Theory Of Computation Full Notes.

Theory Of Computation

Introduction :

Regular Languages and Finite Automata :

1.Finite Automata Introduction
2.Arden’s Theorem and Challenging Applications | Set 2
3.L-graphs and what they represent
4.Hypothesis (language regularity) and algorithm (L-graph to NFA)
5.Regular Expressions,Regular Grammar and Regular Languages
6.How to identify if a language is regular or not
7.Arden’s Theorem

Finite Automata from Regular Expressions
8.Star Height of Regular Expression and Regular Language
9.Generating regular expression from finite automata
10.Designing Deterministic Finite Automata (Set 1)
11.Designing Deterministic Finite Automata (Set 2)
12.DFA for Strings not ending with “THE”
13.DFA of a string with at least two 0’s and at least two 1’s
14.DFA for accepting the language L = { anbm | n+m=even }
15.DFA machines accepting odd number of 0’s or/and even number of 1’s
16.DFA of a string in which 2nd symbol from RHS is ‘a’
17.Union process in DFA
18.Concatenation process in DFA
19.DFA in LEX code which accepts even number of zeros and even number of ones.
20.NFA to DFA Conversion
21Program to Implement NFA with epsilon move to DFA Conversion
22.Minimization of DFA
23.Reversal process in DFA
24.Complementation process in DFA
25.Kleene’s Theorem Part-1
26.MEALY and MOORE Machines
27.Difference between Mealy machine and Moore machine

Context Free Grammar and Context Free Languages :

1.Relationship between grammar and language
2.Simplifying Context Free Grammars
3.Closure Properties of Context Free Languages(CFL)
4.Union & Intersection of Regular languages with CFL
5.Converting Context Free Grammar to Chomsky Normal Form
6.Converting Context Free Grammar to Greibach Normal Form
7.Pumping Lemma
8.Check if the language is Context Free or Not
9.Ambiguity in Context Free Grammar
10.Operator grammar and precedence parser
11.Context-sensitive Grammar (CSG) and Language (CSL)

Pushdown Automata :

1.Pushdown Automata
2.Pushdown Automata Acceptance by Final State
3.Construct Pushdown Automata for given languages
4.Construct Pushdown Automata for all length palindrome
5.Detailed Study of PushDown Automata
6.NPDA for accepting the language L = {an bm cn| m,n>=1}
7.NPDA for accepting the language L = {an bn cm | m,n>=1}
8.NPDA for accepting the language L = {anbn | n>=1}
9.NPDA for accepting the language L = {am b(2m) | m>=1}
10NPDA for accepting the language L = {am bn cp dq| m+n=p+q ; m,n,p,q>=1}
11.Construct Pushdown automata for L = {0n1m2m3n | m,n ? 0}
12.Construct Pushdown automata for L = {0n1m2(n+m) | m,n ? 0}
13.NPDA for accepting the language L = {ambnc(n+m) | m,n ? 1}
14.NPDA for accepting the language L = {amb(n+m)cn| m,n ? 1}
15.NPDA for accepting the language L = {a2mb3m | m ? 1}
16.NPDA for accepting the language L = {amb(2m+1) | m ? 1}
17.NPDA for accepting the language L = {aibjckdl | i==k or j==l,i>=1,j>=1}
18.Construct Pushdown automata for L = {a(2*m)c(4*n)dnbm | m,n ? 0}
19.Construct Pushdown automata for L = {0n1m2(n+m) | m,n ? 0}
20.NPDA for L = {0i1j2k | i==j or j==k ; i , j , k >= 1}
21.NPDA for accepting the language L = {anb(2n) | n>=1} U {anbn | n>=1}
22.NPDA for the language L ={w?{a,b}*| w contains equal no. of a’s and b’s}

Turing Machine :

1.Turing Machine
2.Turing Machine for addition
3.Turing machine for subtraction | Set 1
4.Turing machine for multiplication
5.Turing machine for copying data
6.Construct a Turing Machine for language L = {0n1n2n | n?1}
7.Construct a Turing Machine for language L = {wwr | w ? {0, 1}}
8.Construct a Turing Machine for language L = {ww | w ? {0,1}}
9.Construct Turing machine for L = {anbma(n+m) | n,m?1}
10.Construct a Turing machine for L = {aibjck | i*j = k; i, j, k ? 1}
11.Turing machine for 1’s and 2’s complement
12.Recursive and Recursive Enumerable Languages
13.Turing Machine for subtraction | Set 2
14.Halting Problem
15.Theory of Computation | Applications of various Automata
16.Turing Machine as Comparator

Decidability :

1.Decidable and undecidable problems
2.Decidability
3.Undecidability and Reducibility
4.NP-Completeness | Set 1 (Introduction)
5.Proof that Hamiltonian Path is NP-Complete
6.Proof that vertex cover is NP complete
7.Computable and non-computable problems

Theory Of Computation Full Notes.