Theory of Computation

1. Tutorial

2. TOC Previous Years Solved

• Design a NFA that accepts the language over the alphabet, Σ= {0, 1,2} where the decimal equivalent of the language is divisible by 3.
• DFA end with 1 contain 00 | RGPV TOC draw
• NFA to DFA | RGPV TOC
• Moore to Mealy | RGPV TOC PYQ
• DFA accept even 0 and even 1 |RGPV TOC PYQ
• Short note on automata | RGPV TOC PYQ
• DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
• DFA ending with 101 | RGPV TOC PYQ
• CFL are not closed under intersection | RGPV TOC
• RGPV Define Mealy and Moore Machine
• Diiference between Mealy and Moore machine | RGPV TOC
• Mealy to Moore Conversion | RGPV | Prof. Jayesh Umre
• Construct Moore machine for Mealy machine
• RGPV TOC What is Trap state
• RGPV TOC properties of transition functions
• leftmost and rightmost derivations | RGPV TOC
• RGPV TOC design finite automata problems
• Grammar is ambiguous. S → aSbS|bSaS|∈ | RGPV TOC
• Regular expression to Regular grammar | RGPV TOC
• Regular expresion to CFG | RGPV TOC
• Definition of Deterministic Finite Automata | RGPV TOC
• DFA end with 1 contain 00 | RGPV TOC draw
• RGPV TOC Short note on equivalent of DFA and NFA
• RGPV TOC What do you understand by DFA how to represent it
• RGPV short note on automata
• NDFA accepting two consecutive a’s or two consecutive b’s | RGPV TOC
• RGPV notes Write short note on NDFA
• DFA which accept 00 and 11 at the end of a string | RGPV TOC
• CNF from S–>aAD;A->aB/bAB;B->b,D->d.

3. TOC PYQs Hindi Videos