thnkuu sir for making this video ,, because mai 10 video dekh chuka magr mujhe ab jake pata chla ki actually TOC hai kya......................... again Thkuu so much sir ...........
Sir please make Video on this topics ❤thank you sir Regular Languages and Finite Automata: Regular Expressions, Regular Languages, Application of Finite Automata, Automata with output - Moore machine & Mealy machine, Finite Automata, Memory requirement in a recognizer, Definitions, union- intersection and complement of regular languages, Non Deterministic Finite Automata, Conversion from NFA to FA, - Non Deterministic Finite Automata, Conversion of NFA- to NFA, Kleene’s Theorem, Minimization of Finite automata, Regular And Non Regular Languages - pumping lemma. 12 25 3 Context free grammar (CFG): Definitions and Examples, Unions Concatenations And Kleene’s of Context free language, Regular Grammar for Regular Language, Derivations and Ambiguity , Unambiguous CFG and Algebraic Expressions, BacosNaur Form (BNF), Normal Form - CNF. 08 15 4 Pushdown Automata, CFL And NCFL: Definitions, Deterministic PDA, Equivalence of CFG and PDA & Conversion, Pumping lemma for CFL, Intersections and Complements of CFL, Non-CFL. TM Definition, Model Of Computation, Turing Machine as Language Acceptor, TM that Compute Partial Function, Church Turning Thesis, Combining TM, Variations Of TM, Non Deterministic TM, Universal TM, Recursively and Enumerable Languages, Context sensitive languages and Chomsky hierarchy. 6 Computable Functions: Partial - Total - Constant Functions, Primitive Recursive Functions, Bounded Mineralization, Regular function, Recursive Functions, Quantification, Minimalization, and μ-Recursive Functions, All Computable Functions Are μ- Recursive 04 10 7 Undecidability : A Language That Can’t Be Accepted, and a Problem That Can’t Be Decided , Non Recursive Enumerable (RE) Language - Undecidable Problem with RE - Undecidable Problems about TM - Undecidable Problems Involving Context-Free Languages, Post‘s Correspondence Problem, The Class P and NP
sir we need more videos from your side sir i'm following your contain so knowledge fullness it help me in my study . give me is so easy to understand contaent sir please need more content for same subject like how to create any DFA or NFA. thank you so much sir for greatest content every.
Thank you soo much sir for this video... Sir plz Pune university ke liye Third year ke Computer Network Technology(CNT) ye subject ke liye video banao plz.. IT branch ke subjects ke bhi banao plzz sir
Sir I have one doubt sir Nfa allows backtracking or not... Some sites follows backtracking is not always possible Some sites follows backtracking is may or may not required Which one is correct sir pls tell me sir
thnkuu sir for making this video ,, because mai 10 video dekh chuka magr mujhe ab jake pata chla ki actually TOC hai kya......................... again Thkuu so much sir ...........
Sir please make Video on this topics ❤thank you sir
Regular Languages and Finite Automata:
Regular Expressions, Regular Languages, Application of Finite Automata,
Automata with output - Moore machine & Mealy machine, Finite Automata,
Memory requirement in a recognizer, Definitions, union- intersection and
complement of regular languages, Non Deterministic Finite Automata, Conversion
from NFA to FA, - Non Deterministic Finite Automata, Conversion of NFA-
to NFA, Kleene’s Theorem, Minimization of Finite automata, Regular And Non
Regular Languages - pumping lemma.
12 25
3 Context free grammar (CFG):
Definitions and Examples, Unions Concatenations And Kleene’s of Context free
language, Regular Grammar for Regular Language, Derivations and Ambiguity ,
Unambiguous CFG and Algebraic Expressions, BacosNaur Form (BNF), Normal
Form - CNF.
08 15
4 Pushdown Automata, CFL And NCFL:
Definitions, Deterministic PDA, Equivalence of CFG and PDA & Conversion,
Pumping lemma for CFL, Intersections and Complements of CFL, Non-CFL.
TM Definition, Model Of Computation, Turing Machine as Language Acceptor,
TM that Compute Partial Function, Church Turning Thesis, Combining TM,
Variations Of TM, Non Deterministic TM, Universal TM, Recursively and
Enumerable Languages, Context sensitive languages and Chomsky hierarchy.
6 Computable Functions:
Partial - Total - Constant Functions, Primitive Recursive Functions, Bounded
Mineralization, Regular function, Recursive Functions, Quantification,
Minimalization, and μ-Recursive Functions, All Computable Functions Are μ-
Recursive
04 10
7 Undecidability :
A Language That Can’t Be Accepted, and a Problem That Can’t Be Decided , Non
Recursive Enumerable (RE) Language - Undecidable Problem with RE -
Undecidable Problems about TM - Undecidable Problems Involving Context-Free
Languages, Post‘s Correspondence Problem, The Class P and NP
Bhai Tum Ho isileye hum pass hote hai , back tha iska abb tum agaye ho to pakka pass ho jayenge
sir we need more videos from your side sir i'm following your contain so knowledge fullness it help me in my study . give me is so easy to understand contaent sir please need more content for same subject like how to create any DFA or NFA. thank you so much sir for greatest content every.
I don't understand Hindi but i'm still getting more from this than my professor's lecture
Hi Jack! Did you find any other channel with similarly simply content but on English?
lol how dude without hindi its nearly impossible to understand this
Awsome job, brother
sir ,u are great .i really appreciate u ,u understand the things from example.
sir an uh do a playlist on numerical computing
sir please uplode all the videos of TOC
Please make video lectures on PDA
Thanks sir 👍
thanks sir
Thank you soo much sir for this video... Sir plz Pune university ke liye Third year ke Computer Network Technology(CNT) ye subject ke liye video banao plz..
IT branch ke subjects ke bhi banao plzz sir
You really help me...
Very helpful.
Super video sir
great
greate
sir pure video dekhata ho tension mat lo
ab muzhe tension a raha he toc ka
Sir I have one doubt sir
Nfa allows backtracking or not...
Some sites follows backtracking is not always possible
Some sites follows backtracking is may or may not required
Which one is correct sir pls tell me sir
u have not put the playlist in the serial sequence manner , n this is the biggest mistake u have done
thank you, sir, you videos save my asss