DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 1 (STRINGS STARTS WITH) IN AUTOMATA THEORY || TOC

DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 1
Design DFA which accepts all strings over given alphabet which starts with given substring.

---------------------------------------------------------------------------------------------------------------
AUTOMATA THEORY || THEORY OF COMPUTATION

COMPILER DESIGN

DATABASE MANAGEMENT SYSTEM

DATA STRUCTURES

JAVA PROGRAMMING

R PROGRAMMING

HTML TUTORIALS WITH IMPLEMENTATION || LEARN HTML IN 4 HOURS

LEARN CSS IN 3 HOURS || CASCADING STYLE SHEETS FOR BEGINNERS

JAVA SCRIPT FOR BEGINNERS IN 7 HOURS || LEARN JAVA SCRIPT IN 7 HOURS || JAVA SCRIPT

XML (eXtensible Markup Language)

OPERATING SYSTEM

ETHICAL HACKING

VI EDITOR BASICS IN LINUX / UNIX || LEARN VI EDITOR COMMANDS || LINUX || UNIX

HOW TO DOWNLOAD & INSTALL MySQL IN WINDOWS 10

PYTHON PROGRAMS

C PROGRAMMING

CORE JAVA TUTORIAL FOR BEGINNERS || LEARN CORE JAVA IN 15 HOURS || JAVA TUTORIALS FOR BEGINNERS

PYTHON TUTORIALS FOR BEGINNERS (తెలుగు లో)

PYTHON OOPS - MODULES - EXCEPTION HANDLING (తెలుగు లో)

PYTHON NUMPY TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE NUMPY TUTORIALS IN TELUGU

PYTHON PANDAS TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE PANDAS TUTORIALS IN TELUGU || DATA SCIENCE

MATPLOTLIB LIBRARY - PYTHON PROGRAMMING (ENGLISH)

PYTHON DATABASE CONNECTIVITY - MYSQL & MS-EXCEL

DATA STRUCTURES USING PYTHON (ENGLISH)

----------------------------------------------------------------------------------------------

[StevosSows]

Incredible explanation, very minimalistic yet very robust method and very clean and clear drawing and writing! Definitely the best teacher of comp theory in the world! Thanks Sundeep!

[AjayKumar-viei]

Good explanation helpful for Students who r taking Semester Exams Simple and Easy సార్

[albela]

its amazing sir i enjoying the automata. great work sir, i have started watching video today and lets see when i fill left comment in the last video

[rakshitathakre]

Great Explanation sir, Every topic became easy after watching each video..

[Rajakhan_]

Awesome explain sir ❤ love you from Bihar ❤

[pujyamvssnkdheeraj]

Sir as we Known DFA has only 1 transaction state, but u make 2 transactions from ( q1, 0 ) -> q1 & dead state. I think that's wrong. @14:00

[deepakvishwakarma]

but the diagram was a NFA it has multiple path for other state . can you please explain

[growthinstinct]

Sir.... shouldn't we use 1 on q1 instead of zero and dead state we will get 01 onle there @14:21

[-vikashn.m]

one doubt sir, shouldn't the number of states = number of input symbols + one which is no of states should be 3 ??? but ur solving with 2 states
???

[thecookingcave]

Sir why you gave t
Dead state in 2nd example
Can't we give transition to q0 or q2???

[vinaykarthikeya]

sir is it possible for dfa that finall state may have 2 two inputs for same state ?

[jydutdutso]

Sir can u explain the problem The set of all strings such that each block of five consecutive symbols contains atleast two 0's where alphabet is 0, 1

[kusumakarvemula]

🎯 Key Takeaways for quick navigation:

00:32 🚀 *Constructing DFA for "Starts With 0" Problem*
- The problem is to construct a DFA that accepts strings starting with the digit '0'.
- The language L is defined as strings over the alphabet {0, 1} that start with '0'.
- The minimum string length is 1, requiring two states for the DFA, with transitions for both '0' and '1'. A dead state is added to handle strings not starting with '0'.
11:08 🧩 *Constructing DFA for "Starts With 01" Problem*
- The problem is to construct a DFA that accepts strings starting with the substring '01'.
- The language L is defined as strings over the alphabet {0, 1} that start with '01'.
- The minimum string length is 2, requiring three states for the DFA. A dead state is introduced to handle strings not starting with '01', ensuring all transitions are defined for every state and input symbol.

Made with HARPA AI

[jwalinbagthaliya]

Is there any other answer for the string starting with ab??

[thearyan]

14:16 not self loop in q1 bcz string start with 01. -q0--0-->q1--1-->q2

[slaxmipriya_]

Sir in the 2nd example q1 state has 2 0's as input then this is not dfa right?!

[kendrixXoriginal]

Is this DFA applicable in the industry??? Why we are learning this it's so hard to study no doubt your explain is so good but is it applicable anywhere !!! NO !!!

[MR.Vofficial]

Tomorrow Internal still now I can't understand 🥴🙄

[chockalingam]

Sir why fa has only one initial state????

[just_call_me_vikky]

Why can't we pass q1 to q0 with input 0?