CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING DIRECT METHOD IN AUTOMATA THEORY || TOC

INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES

BASIC NOTATIONS & REPRESENTATIONS IN AUTOMATA THEORY || BASICS OF AUTOMATA || THEORY OF COMPUTATION

WHAT IS FINITE AUTOMATA AND REPRESENTATION OF FINITE AUTOMATA || THEORY OF COMPUTATION

TYPES OF FINITE AUTOMATA (DFA & NFA) IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION

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

DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 2 (STRINGS ENDS WITH) IN AUTOMATA THEORY || TOC

DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 3 (SUBSTRING OR CONTAINS) IN AUTOMATA THEORY || TOC

DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 4 (STRING LENGTH) IN AUTOMATA THEORY || TOC

DETERMINISTIC FINITE AUTOMATA EXAMPLE - 5 (DIVISIBLE BY) IN AUTOMATA THEORY || THEORY OF COMPUTATION

DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 6 (EVEN'S & ODD'S) IN AUTOMATA THEORY || TOC

MINIMIZATION OF DFA WITH EXAMPLE IN AUTOMATA THEORY || DFA MINIMIZATION || TOC
NFA (NON DETERMINISTIC FINITE AUTOMATA) WITH EXAMPLE IN AUTOMATA THEORY || THEORY OF COMPUTATION

NFA (NON DETERMINISTIC FINITE AUTOMATA) WITH EPSILON IN AUTOMATA THEORY || NDFA || TOC

DIFFERENCES BETWEEN DFA & NFA IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION

EPSILON CLOSURE IN AUTOMATA THEORY || NFA WITH EPSILON || TOC

CONVERSION OF NFA WITH EPSILON TO NFA WITHOUT EPSILON IN AUTOMATA THEORY || TOC

CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC

EQUIVALENCE BETWEEN TWO DFA IN AUTOMATA THEORY || EQUIVALENCE BETWEEN TWO FSM'S || TOC

REGULAR EXPRESSIONS IN AUTOMATA THEORY || REGULAR EXPRESSION WITH EXAMPLE || TOC

IDENTITY RULES FOR REGULAR EXPRESSIONS IN AUTOMATA THEORY || IDENTITIES OF REGULAR EXPRESSIONS ||TOC

ARDEN'S THEOREM IN AUTOMATA THEORY || EQUIVALENCE OF TWO REGULAR EXPRESSIONS || DFA TO RE || TOC

CONVERSION OF FINITE AUTOMATA TO REGULAR EXPRESSION USING ARDENS METHOD IN AUTOMATA THEORY || TOC

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

CONVERSION OF REGULAR EXPRESSION TO FINITE AUTOMATA USING SUBSET METHOD IN AUTOMATA THEORY || TOC

[studytopass]

Thank u so much sir! So grateful for this video!

[shirishareddy]

Thank you sir your classes are helping me alot ❤️

[nagachaithanya]

Construct the finite automation to accept the following regular expression:

(a+b)* (aa+bb) (a+b)*


Sir can you please solve this question

[lavanyaseepana]

Sir !! A video on Mealy and moori machines. Please.. that will really help us a lot

[dlgkhim]

Thank u so much, may ask u about last example, as known every state in FS must have 2 outputs
But the start state has 3 outputs in your example!

[Maha-pkvm]

sir can you please suggest few books for refering c language and practice books too ? please reply sir its urgent

[Allinone-cklc]

Sir Make video on reverse array indexing

[debosmitachakraborty]

sir, for 0* the first state will e also final state ?

[runallinonechannel]

How many ways convert re to finite automata in flat subject sir

[kennadysil]

Thank you sir.
R. E= (a+b) *
R. E= (ab) *
I am in doubt. Please draw the FA diagram for this two sir.

[jesus_life]

Mee board clear ga undetattu pettandi... It's not clear