CONVERSION OF FINITE AUTOMATA TO RE USING STATE ELIMINATING METHOD IN AUTOMATA THEORY || TOC

CAT Batches on Unacademy - unacademy.com/goal/cat-other-...
All India Mock Test - unacademy.com/scholarship/aim...
Enroll now - unacademy.com/goal/cat-other-...
Use code SUNDEEP10 to get additional 10% discount
-----------------------------------------------------------------------------------------------------------
CONVERSION OF FINITE AUTOMATA TO REGULAR EXPRESSION USING STATE ELIMINATING METHOD
Step-1 : INITIAL STATE MUST NOT HAVE INCOMING EDGE
Step-2 : FINITE AUTOMATA MUST HAVE SINGLE FINAL STATE
Step-2 : FINAL STATE MUST NOT HAVE OUTGOING EDGE
Step-3 : ELIMINATE EVERY STATE ONE AFTER ANOTHER
Step-4 : FINAL FINITE AUTOMATA WILL HAVE ONLY 2 STATES (INITIAL & FINAL)
-------------------------------------------------------------------------------------------------------------------
INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES
• INTRODUCTION TO AUTOMA...
BASIC NOTATIONS & REPRESENTATIONS IN AUTOMATA THEORY || BASICS OF AUTOMATA || THEORY OF COMPUTATION
• BASIC NOTATIONS & REPR...
WHAT IS FINITE AUTOMATA AND REPRESENTATION OF FINITE AUTOMATA || THEORY OF COMPUTATION
• WHAT IS FINITE AUTOMAT...
TYPES OF FINITE AUTOMATA (DFA & NFA) IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
• TYPES OF FINITE AUTOMA...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 1 (STRINGS STARTS WITH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 2 (STRINGS ENDS WITH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 3 (SUBSTRING OR CONTAINS) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 4 (STRING LENGTH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA EXAMPLE - 5 (DIVISIBLE BY) IN AUTOMATA THEORY || THEORY OF COMPUTATION
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 6 (EVEN'S & ODD'S) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
MINIMIZATION OF DFA WITH EXAMPLE IN AUTOMATA THEORY || DFA MINIMIZATION || TOC
• MINIMIZATION OF DFA WI...
NFA (NON DETERMINISTIC FINITE AUTOMATA) WITH EXAMPLE IN AUTOMATA THEORY || THEORY OF COMPUTATION
• NFA (NON DETERMINISTIC...
NFA (NON DETERMINISTIC FINITE AUTOMATA) WITH EPSILON IN AUTOMATA THEORY || NDFA || TOC
• NFA (NON DETERMINISTIC...
DIFFERENCES BETWEEN DFA & NFA IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
• DIFFERENCES BETWEEN DF...
EPSILON CLOSURE IN AUTOMATA THEORY || NFA WITH EPSILON || TOC
• EPSILON CLOSURE IN AUT...
CONVERSION OF NFA WITH EPSILON TO NFA WITHOUT EPSILON IN AUTOMATA THEORY || TOC
• CONVERSION OF NFA WITH...
CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC
• CONVERSION OF NFA TO D...
EQUIVALENCE BETWEEN TWO DFA IN AUTOMATA THEORY || EQUIVALENCE BETWEEN TWO FSM'S || TOC
• EQUIVALENCE BETWEEN TW...
REGULAR EXPRESSIONS IN AUTOMATA THEORY || REGULAR EXPRESSION WITH EXAMPLE || TOC
• REGULAR EXPRESSIONS IN...
IDENTITY RULES FOR REGULAR EXPRESSIONS IN AUTOMATA THEORY || IDENTITIES OF REGULAR EXPRESSIONS ||TOC
• IDENTITY RULES FOR REG...
ARDEN'S THEOREM IN AUTOMATA THEORY || EQUIVALENCE OF TWO REGULAR EXPRESSIONS || DFA TO RE || TOC
• ARDEN'S THEOREM IN AUT...
CONVERSION OF FINITE AUTOMATA TO REGULAR EXPRESSION USING ARDENS METHOD IN AUTOMATA THEORY || TOC
• CONVERSION OF FINITE A...

[@m.s.murthymurthy6539]

Sir in example 2 the answer can be this na sir: c*a(d+bc*a)*

[@saikiranmaragouni1364]

Sir ! , In the last example when you eliminate q2. -->q2 having (d+bc*a) as self loop.so can we write c*a (d+bc*a)*

[@afrdthzna3851]

It should be c*a(d*+bc*a)*

[@m.s.murthymurthy6539]

Ha same douth sir.....

[@sneakyturtle9946]

@@afrdthzna3851 (d*+bc*a)*=(d+bc*a)* think of it like (0*+1)* =(0+1)*

[@spoorthishet1196]

Yeah

[@coronacat7077]

yes u R Ri8

[@siu21400]

0:00 - 8:24 Explanation
10:37 - 19:44 Example 1
19:50 - 28:28 Example 2

[@Surya_Kiran_K]

Thank you vm

[@madhu_399]

sir ,
I had a doubt that, In 2nd example RE is [ c*a . (b c* a)*].....
because, from states qi ----> qf we can move in two ways [c* a.E(epslon)] or in [ c*a . (b c* a)* . E(epslon)].....
because it having self loop.....

[@supraja2322]

Sir Can you make a full video tutorials on SQL

[@divyaagarwal3563]

Wonderful explanation 👏👌

[@chandravarma4663]

Sir, 0.0*.0=?

[@SanjayBalaji-eg4ih]

Sir for example 2 why arden's method is not working

[@user-hz1pr6fm5i]

Your supremacy sir, learning you for five years now, since diploma to engineering...
Thank you 🎉

[@ashrithh7621]

👏👏🙏

[@kennadysil7806]

Thank you sir

[@ramakrishnarajk5234]

arumayaa padam edukkreenga uncle neenga endha clg la irekeenga sollunga naanum vanthu senthukkeren

[@SanthoshKumar-jc5fg]

board not visble

[@roshnimenon3813]

sir, please let know the prescribed text of this syllubus...

[@legendneverdiegaminglndg4136]

I'm just crying

[@honeyhoney1966]

sir can u explain r20 paper problems 2020 flat