2.18 Types of Grammar and Chomsky Hierarchy ||TOC|| FLAT

preview_player
Показать описание
In this video we covered Chomsky hierarchy.
1. regular grammar(Finite automata)
2. context free grammar(push down automata)
3. Context sensitive grammar(Linear bounded automata)
4. unrestricted grammar(Turing machine)

See Complete Playlists:

TOC/FLAT:

Technical Mcqs:

Design and analysis of algorithms:

python:

Data Structures:

Advanced Data Structures:

Machine Learning:

Operating Systems:

Java Programming:

Network Security:

C++:

Programs on c:

Computer Graphics:

Рекомендации по теме
Комментарии
Автор

Only Professor that teaches Everything, Respect From Punjab sir ♥️

GadgetlokbyAkash
Автор

I just saw this video in the morning of exam day
This question came in paper for 10 marks(2021) ToC
I attended it 😚
Tq sir

vinuthsvinu
Автор

Watched all youtube videos on chomsky hierarchy and can bet on this being the best!

shubhambatham
Автор

Anna chala Baga explain chesavu you will get a million subscribers soon

abc-ymzs
Автор

Really, I like your way of teaching, I saw Ist time ur video, u explained in a very easy way 👍

ishtasinghal
Автор

Perfect video which I want thank you sir 😌

rehanahmad
Автор

Thank you it's very easy to understand

priyak