UNIT 3.

1.Context Free Grammar Definition:

https://www.geeksforgeeks.org/what-is-context-free-grammar/

->https://www.javatpoint.com/context-free-grammar

https://www.tutorialspoint.com/what-is-context-free-grammar-explain-with-examples

https://www.javatpoint.com/automata-context-free-grammar

https://youtu.be/5_tfVe7ED3g?si=nxOqyyygP6ns6bZ2

https://youtu.be/SlSA9vEXCm4?si=g2qQDlkRgrCF7BQH

https://youtu.be/5_tfVe7ED3g?si=thAx_Bwn5gRVDlpt

2. Context Free Grammar Derivation Tree:

https://www.javatpoint.com/automata-derivation-tree

https://www.tutorialspoint.com/what-is-a-derivation-tree-in-toc

https://youtu.be/u4-rpIlV9NI?si=6Va7FLfmqAXamyL4

https://youtu.be/nUVmsW68K0Y?si=0tfHHiiynlKMb3Qf

->https://youtu.be/kFJaUtkn9wo?si=Di5eWFZzI8HCRDU8

https://youtu.be/NLw6OoDeuf0?si=7QMcV2T9QgeRsqXx

https://youtu.be/k0EVZTJnEXQ?si=rVpSpjESlTYVmMIQ

https://youtu.be/y7TJswcOQt4?si=QE2mIzxsTqzYJLnQ

3. Ambiguity in CFG:

https://www.geeksforgeeks.org/ambiguity-in-context-free-grammar-and-context-free-languages-2/

https://www.geeksforgeeks.org/ambiguity-in-context-free-grammar-and-context-free-languages/

https://www.tutorialspoint.com/automata_theory/ambiguity_in_grammar.htm

https://www.javatpoint.com/automata-ambiguity-in-grammar

https://www.javatpoint.com/eliminating-ambiguity-of-a-context-free-grammar

https://www.youtube.com/watch?v=i-xrAmOR314

https://www.gatevidyalay.com/tag/ambiguity-in-cfg-with-example/

https://youtu.be/gUaAKAj-rqA?si=wrb1mtP6yMDgf2EW
https://youtu.be/Ov1N3UJEe28?si=Tw-EG_cl5Uqr6b16

4.Simplification of CFG:

https://www.javatpoint.com/automata-simplification-of-cfg

https://www.geeksforgeeks.org/simplifying-context-free-grammars/

https://www.tutorialspoint.com/automata_theory/cfg_simplification.htm

https://www.tutorialspoint.com/automata_theory/chomsky_normal_form.htm

https://www.tutorialspoint.com/automata_theory/greibach_normal_form.htm

https://www.tutorialspoint.com/automata_theory/greibach_normal_form.htm

https://youtu.be/EF09zxzpVbk?si=NH2H4UFAoJcA73Sz

https://youtu.be/8rkzd4CuCD0?si=nv_926c7i2lnCHw6

https://youtu.be/dPMIWf524ls?si=CN_LFJEH3FSDsuHE

5. Normal form of CFG

https://youtu.be/Mh-UQVmAxnw?si=ovmsAhggXBYd9ahG

https://youtu.be/FNPSlnj3Vt0?si=P744VC6BHWOKLkv5

https://www.geeksforgeeks.org/converting-context-free-grammar-chomsky-normal-form/

https://www.javatpoint.com/automata-chomskys-normal-form

https://www.tutorialspoint.com/automata_theory/chomsky_normal_form.htm

https://www.javatpoint.com/automata-greibach-normal-form

https://youtu.be/ZCbJan6CGNM?si=MUYyibBVpD7mchmv

https://youtu.be/iL6YrS_f1YM?si=YtDIlhm7q7JD0i0p

https://youtu.be/Ese3Xvs-nqM?si=_VWTKlBhqTx9W_DU

https://youtu.be/cE0GrkFX7l0?si=DzVIdTxVDJYBgMdH

https://youtu.be/G_xUKj1oGL8?si=YVadkhHxV2YRma3Z

6.Closure property of CFL

https://youtu.be/0KsU-gavbE4?si=hFx-r5NyKpN8XlfQ

https://youtu.be/XEhUMkmVMGs?si=Dt9P013MNSwsof1-

https://youtu.be/mhd4gJk073I?si=dmNAgbzrhGv_tuhw
https://youtu.be/hGl54tBWFAw?si=YtbXYry1VzU7Vuh5

https://youtu.be/0BnJtyKp14Y?si=U_vFcPfmtJAPe-ic

https://youtu.be/k0oTpJNFJ6A?si=7cKwh_UrSNWJxsPm

https://youtu.be/dYgs_nhK0X8?si=mdBfCRDlFiB8IJ2_

7.Emptiness Testing and Pumping Lemma test

https://youtu.be/MjytuGOr614?si=QuvwsYBwbzhSUlAB

https://youtu.be/qFZAblZiO08?si=VRkMTCwaFYBnG5zK

https://www.tutorialspoint.com/automata_theory/pushdown_automata_introduction.htm

https://youtu.be/ww4m4UJTbWE?si=FMZsaF5EshR-HF_W

https://youtu.be/jRhqx1_KcCk?si=CEoQR0Qfs8v9cGLp

https://youtu.be/qFZAblZiO08?si=MoL-BkhqihiYRVSy

8. Push Down Automata

https://www.tutorialspoint.com/automata_theory/pushdown_automata_introduction.htm

https://www.tutorialspoint.com/automata_theory/pushdown_automata_acceptance.htm

https://www.tutorialspoint.com/automata_theory/pda_context_free_grammar.htm

https://www.tutorialspoint.com/automata_theory/pda_context_free_grammar.htm

https://www.geeksforgeeks.org/pushdown-automata-acceptance-final-state/?ref=next_article

https://www.geeksforgeeks.org/construct-pushdown-automata-given-languages/?ref=next_article

https://www.javatpoint.com/pushdown-automata

https://www.javatpoint.com/automata-pda-acceptance

https://youtu.be/7lcwlNNCP1E?si=N-TTlQ27hDFQrFPr

https://youtu.be/4ejIAmp_Atw?si=RMsx9npXHiQfjxdE

https://youtu.be/JtRyd7Svlew?si=JzRIwkcekR4u_l1r

https://youtu.be/eY7fwj5jvC4?si=aYT44OKPF1XpfTD8

9. Instantaneous description and acceptance of PDA

https://www.tutorialspoint.com/what-is-the-instantaneous-description-of-pda\

https://youtu.be/fpomV4QwKQE?si=VB0TSnENQZgC4l-t

https://youtu.be/zFUGQTCerRQ?si=28F_VIJYLedN1_KJ
https://youtu.be/Lf8yACvGK_w?si=qwBua-cUzs-ErZ7l

10. Equivalence conversion of PDA to CFG and vice versa

https://youtu.be/ispC7-KKvqw?si=fymujziHpTUuWe4w

https://youtu.be/fx2gQptXAyk?si=RCTz-WbAwkATX8ND

https://youtu.be/FjGrU7vczyg?si=E6BwIJAqPUOViSgh

https://www.javatpoint.com/automata-cfg-to-pda-conversion

https://www.tutorialspoint.com/how-to-convert-context-free-grammar-to-push-down-automata

https://youtu.be/mehO_4R7D6o?si=1CndXHLyYg_L2GEv

https://youtu.be/iMq3Wc382m8?si=U87nHRZHOD9L-ZHv

https://youtu.be/ispC7-KKvqw?si=mSWaBOgGXyQX8C08

https://youtu.be/ZImtQBMSW_Y?si=vQ6yIyLHIf-gc6_7

https://youtu.be/2oC3z3jyh-I?si=HdoYjmuXvaqVokCF

https://www.youtube.com/watch?v=ispC7-KKvqw

UNIT-4

11.Turing Machine Definition and language acceptance

https://www.geeksforgeeks.org/turing-machine-in-toc/

https://www.tutorialspoint.com/automata_theory/turing_machine_introduction.htm

https://www.tutorialspoint.com/automata_theory/accepted_and_decided_language.htm

https://www.tutorialspoint.com/automata_theory/multi_tape_turing_machine.htm

https://www.tutorialspoint.com/automata_theory/multi_track_turing_machine.htm

https://youtu.be/k8CwwkhMPjM?si=a_DL_Jwm7Al_ugx6

https://youtu.be/LE_7krgRGt8?si=Z09wmz5czYK36pkQ

https://youtu.be/LE_7krgRGt8?si=Z09wmz5czYK36pkQ

https://youtu.be/CRlMCRm0-Ak?si=z3_L96mQcoNHmv7F

https://youtu.be/PvLaPKPzq2I?si=fsgz10R7_6PiZt5t

https://youtu.be/BLj6ghK_IsE?si=vGRnx8FseKwCJWYZ

https://youtu.be/KpSyAC9inb0?si=0ZOVx5IAAZNyWYqW
12. deterministic and Non deteriministic turing machine

https://www.tutorialspoint.com/automata_theory/non_deterministic_turing_machine.htm

https://youtu.be/gQnPM6sydkk?si=UUO0jdZtEaS7xr2T

https://youtu.be/RmSmZ7wL-rQ?si=gE6m3_wKhWMNfzQo

https://youtu.be/ULKYuxF9er8?si=F6k_Ozqkpa-zA1Xa

https://youtu.be/nHxp_ULMa2Q?si=_1JuXIVF7Fm8WF7a

https://youtu.be/9Bk11XgiC1E?si=vV7Tbnq5saXnWWVE

https://youtu.be/q0W_8MS4i7c?si=yBKOvllH_5woeLLx

https://youtu.be/ihfoceT49dw?si=Md7L9tZYMD_mtO5A

https://youtu.be/RmSmZ7wL-rQ?si=KrzFn68qiZqIP5_O

https://youtu.be/moTwYzaOO94?si=nsTh380A7qMIy47p

https://youtu.be/k8CwwkhMPjM?si=xNvBZSSscqeNHkbC

13. Turing machine as computer of integer function:

https://youtu.be/bdpiatQ5rz4?si=WEkt4RXyQqhgBDZx

https://youtu.be/yLGwJoeA84Q?si=fSXzzdzWEKSuznIb

14. Variants of Turing Machine

https://www.geeksforgeeks.org/variation-of-turing-machine/

https://www.tutorialspoint.com/what-are-the-turing-machine-variations-in-toc

https://medium.com/@piyush.ghante22/turing-machine-and-its-variants-b41ed645d5cc

https://youtu.be/Zz2bVMJ1wIU?si=LBAqS33COR5-fTGw

https://youtu.be/AipD1Yn-XAM?si=tz9UB8RGOy_b8Dg7

https://youtu.be/D3cYa4Gs1dk?si=VqxbM_r41d5BOUPr

https://youtu.be/RXrljRY5DIs?si=ogvID8aNi6Ay9zd7

https://youtu.be/Xa2d3taZCI8?si=l24AcI958RJeXs9k

https://youtu.be/NSml0ArQqoI?si=XHWNHT2_ZMYqxpuw
15. Universal Turing Machine

https://youtu.be/eKCX-4_jzck?si=GuFTzt0uIv5ZOZrp

https://youtu.be/J6x8_pZGbXk?si=oqw9We0hvp2TcMY7

 https://youtu.be/J6x8_pZGbXk?si=s7CmuXHRKdmk6E3w

https://youtu.be/f0qgz5GM8-U?si=tFmw-zvNhQbu1E7R

https://www.geeksforgeeks.org/universal-turing-machine/

https://www.tutorialspoint.com/explain-the-universal-turing-machine-in-toc

https://www.geeksforgeeks.org/difference-between-turing-machine-and-universal-turing-machine/


16. Turing Church Thesis

https://youtu.be/0D7yInuKvKs?si=s1fGS7HZzNzfACfO

https://youtu.be/SfTI0vsNX68?si=sPu6zqYirjzArK3U

https://youtu.be/1OteiHxmWqg?si=1afT09iSwvWJGt5z

https://youtu.be/1OteiHxmWqg?si=zqZYa4WM-ymKdZy4

https://youtu.be/J-oLUXmoM_g?si=5PjobGVyfyRcG1d7

https://youtu.be/v3AQsBE8xSI?si=7u5nOfn1DBap6Q3d

https://youtu.be/v3AQsBE8xSI?si=7u5nOfn1DBap6Q3d

17.Recursive and Recursive Enumerable language

https://www.geeksforgeeks.org/recursive-and-recursive-enumerable-languages-in-toc/

https://t4tutorials.com/difference-between-recursive-and-recursively-enumerable-languages/

https://youtu.be/oCBi3g0N358?si=bCrtqXQNK0b3jDVq

https://youtu.be/0w2QbwBf2Tc?si=6CYQhuWWAXpNNaQL

https://youtu.be/mX9lULtwO0s?si=8Q6ZvEUtij5fFQ8T

https://youtu.be/mX9lULtwO0s?si=8Q6ZvEUtij5fFQ8T

https://youtu.be/eDcle00lWIw?si=Yl6X9_os0yiRYIhI
UNIT.5: Decidability and Computation models:

->Undecidable problems:

https://youtu.be/FQhfj_7evJs?si=FCoZ6tgYKSp2zuqU

https://www.geeksforgeeks.org/decidable-and-undecidable-problems-in-theory-of-computation/

https://www.geeksforgeeks.org/decidability-and-undecidability-in-toc/

https://www.tutorialspoint.com/explain-the-decidable-and-undecidable-problems

https://www.studocu.com/row/document/ambo-university/artificial-intelligence/decidable-and-undecidable-
problems-in-theory-of-computation-geeksfor-geeks/23903645

https://www.geeksforgeeks.org/undecidability-and-reducibility-in-toc/

Halting problems of toc

https://youtu.be/0Q9qAM2htII?si=9jejPkI76Okt_agp

https://youtu.be/pE0CZWYUcp0?si=u5rpB80hVvS4J0fP

https://youtu.be/6XZvw9W9QSc?si=aNjfx3TtBubsOy7M

https://youtu.be/nSwxoiFa1vs?si=byf5ixF8ygiR21IN

https://youtu.be/_eM0-KfAmhQ?si=ARSi79KL-QZp1LCK

PCP problem:

https://www.geeksforgeeks.org/halting-problem-in-theory-of-computation/

https://www.tutorialspoint.com/what-is-the-halting-problem-in-toc

https://www.tutorialspoint.com/automata_theory/turing_machine_halting_problem.htm

https://www.geeksforgeeks.org/post-correspondence-problem/

https://www.javatpoint.com/automata-post-correspondence-problem

https://youtu.be/i4ExycknkHY?si=Fa24nLZFktfNDjg6

https://youtu.be/FJ4wukpnRWQ?si=NLL_MPQ66z0BBs8s

https://youtu.be/7w9elZjJ9Ko?si=35bnOAYT11tLpEgP
Recursive Function Theory

https://youtu.be/WinQg2kXtdc?si=IdM3GtK66vRQ5jzX

https://youtu.be/NnMbdWV9VzQ?si=wPzGzrf96AWF-Kjf

https://youtu.be/NnMbdWV9VzQ?si=anxw3DTz7Ea6ge1S

https://www.geeksforgeeks.org/total-recursive-functions-and-partial-recursive-functions-in-automata/

NP completeness and NP hard problems

https://youtu.be/e2cF8a5aAhE?si=bERI6_LPeec-toM0

https://youtu.be/7GiM_LlzYx0?si=UvWjprslEEAnXD2U

https://www.youtube.com/watch?v=0sQ37m3whP4&list=PLQfaHkBRINsxngvO_CIM74kUauPd-BGa3

https://youtu.be/NQaJayrB71s?si=1ahk6w8vdwdv7SoZ

https://www.youtube.com/watch?v=f7U7UK6iiU4&list=PLTZbNwgO5eboxncIsmq95u_4nCtyziLKX

https://youtu.be/2cyryXRmN5Q?si=eHIql6NxoY4URnh3

https://youtu.be/valpD5Jx7aw?si=1qqbptkBgxganyag

https://www.geeksforgeeks.org/difference-between-np-hard-and-np-complete-problem/

https://www.geeksforgeeks.org/types-of-complexity-classes-p-np-conp-np-hard-and-np-complete/

https://www.tutorialspoint.com/design_and_analysis_of_algorithms/
design_and_analysis_of_algorithms_np_hard_complete_classes.htm

https://byjus.com/gate/difference-between-np-hard-and-np-complete-problem/

Time AND space complexity

https://www.geeksforgeeks.org/time-complexity-and-space-complexity/

https://www.tutorialspoint.com/design_and_analysis_of_algorithms/
design_and_analysis_of_algorithms_space_complexities.htm

https://www.tutorialspoint.com/time-and-space-complexity-in-data-structure

https://youtu.be/0yHYbz-Hec8?si=3hxPMviMXFPpzAck

https://youtu.be/aQsJSUXwFco?si=cZMYjcwGq0Ey-CE2

https://youtu.be/eHMYjlcHt5E?si=8HRIS4Q54W5bmIH0

https://www.youtube.com/watch?v=ssCoR-Zd-4s&list=PLG9aCp4uE-s3-Tw69ITou4HzcpcoJaBhs
Recent trends and application of automation

Q.

(1) Show that the union of two recursively enumerable languages is recursively enumerable and
when does a recursively enumerable language is said to be recursive [BL-3].

(2) Show that the union of recursive language is recursive and when can we say a problem is
decidable? Give an example of undecidable problem? [BL-3].

(3) Show that the following problem is undecidable. “Given two CFG’s G1 and G2, is L(G1)
∩L(G2) =Φ?” [BL-3].

(4) Give an example for a non-recursively enumerable language and an undecidable problem [BL-
2].

(5) Prove that PCP= {<P> |P is an instance of the post correspondence problem with a match} is
undecidable [BL-3].

(6) Explain recursive language and recursively enumerable language with suitable example [BL-2].

(7) Explain each of the following: [BL-2].

(8) Explain NP completeness with examples also explain Halting problem of TM [BL-2].
(11) Explain recursive language and recursively enumerable language with suitable example.
[BL-2]
(12) Write short note on: [BL-1]
(13) Turing Reducibility b) Multitap TM
(14) Write short note on NP completeness, P, NP and NP hard problems with examples. [BL-2]
(15) Write notes on the following: [BL-2]
i. Decidable and Undecidable problems
ii. Halting problem of TM.

--