DFA Deterministic Finite Automata Definition Explained with Examples in Hindi Theory Of Computation

preview_player
Показать описание
Myself Shridhar Mankar a Engineer l YouTuber l Educational Blogger l Educator l Podcaster.
My Aim- To Make Engineering Students Life EASY.




A small donation would mean the world to me and will help me to make AWESOME videos for you.

Playlists :

• 5 Minutes Engineering Podcast :

• Aptitude :

• Machine Learning :

• Computer Graphics :

• C Language Tutorial for Beginners :

• R Tutorial for Beginners :

• Python Tutorial for Beginners :

• Embedded and Real Time Operating Systems (ERTOS) :

• Shridhar Live Talks :

• Welcome to 5 Minutes Engineering :

• Human Computer Interaction (HCI) :

• Computer Organization and Architecture :

• Deep Learning :

• Genetic Algorithm :

• Cloud Computing :

• Information and Cyber Security :

• Soft Computing and Optimization Algorithms :

• Compiler Design :

• Operating System :

• Hadoop :

• CUDA :

• Discrete Mathematics :

• Theory of Computation (TOC) :

• Data Analytics :

• Software Modeling and Design :

• Internet Of Things (IOT) :

• Database Management Systems (DBMS) :

• Computer Network (CN) :

• Software Engineering and Project Management :

• Design and Analysis of Algorithm :

• Data Mining and Warehouse :

• Mobile Communication :

• High Performance Computing :

• Artificial Intelligence and Robotics :
Рекомендации по теме
Комментарии
Автор

my college's professor took almost 3 hours to explain this easy topic and even after that i could not understand the topic but your video explained this topic in 5 minutes.thanks

UTHOOBG
Автор

You earned my subscription
Very well done sir
Appreciated😊

calisthenics-
Автор

Thnkx alot much more informative may Allah bless uh ❤

aqsawaheed
Автор

Sir plz make video on Regular Expression And Context Free Grammar and computational Complexity Of T.E. IT, Pune University

thegreatmarathahindu
Автор

Video bohot bohot acha laga sir ji, keep it up

CM-rrhq
Автор

Task 2
Let Σ = {0, 1}. Give DFAs M = (Z, Σ, δ, z0, E) that recognize the following languages:
a) The set of all words whose number of 0s is equal to 2 modulo 5.
b) The set of all words ending in 10101.
c) The set of all words whose third last and second last letter is 0.
d) The set of all words that contain 000 or 010.

Kindly help me

Homeage_style
Автор

Sir 3 rd of May 2019 ko paper hai toc ka.. Plz upload it soon

thegreatmarathahindu
Автор

Hey friend! Please, can you explain what a 'STATE' is? Please, this is the main confusing point for a lot of people including me. Thanks :)

skillzworld
Автор

Exam in one hour and I am here for quick revision

Allgood
Автор

Set theory
Mathematical induction is missing

amitdangar
Автор

sir 4.44 se nahi samaja aur aisa laga raha he jaise yahi quation gate me puchenge

bhagwatdhavale