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

[@satish537]

A HUGE THANK YOU SIR WITH ALL YOUR LECTUTE VIDEOS I HAVE ATTEMPTED 60 MARKS IN SEMISTER CONFIDENTLY!
thankyou from my bottom of my heart!

[@bluedip]

But how much you get 😀

[@shashankgaikwad5825]

Theory of Computation. I was waiting on this sir. Thank you for starting this

[@SanjayKumar-ps7jt]

Bro Which couse u enrolled now .

[@santoshkar267]

One of the best and very different and very difficult subject in the world of computer science.... This subject is has also relationship with other subjects like electrical and electronics engineering also

[@sheikhrashid3055]

1:46
Microwave is a word.
Microwove is an emotion

[@loveurself01]

Thank sir I am fan of your videos..

[@danceflorr6758]

thank you sir i passed FLAT with ur lectures. Thankyou i taught its an impossible task.

[@trythis7161]

All the videos are clearly understood and explanation is good add still more topics in formal language automata theory if possible

[@ravikanth4525]

Plz make a video on cloud computing sir

[@ModernWorld876]

Cloud computing gurinchi telugu lo video cheyyandi sir

[@MBindu-kc2nj]

Keep on doing sir

[@DEVARASIVAYSRCP]

Tqs for start this station

[@elho3750]

can anyone help ?
A finite state automaton, A, is generally determined by a 5-tuple.
A = (Q; V; δ; I; F) such that:
-I is the set of initial states (I ⊆ Q).
-I is the set of initial states (I ⊆ Q).
-F is the set of final states (F ⊆ Q).
-V is the vocabulary on which the transitions of the automaton are labeled (V= X ∪ {ε} such that X is the alphabet on which the language represented by this automaton is defined).
-δ is the transition relation defined by the finite set of transitions of the form (Si , v, Sj) where Si and Sj are states of Q and v is a symbol ∈ V. We denote it δ (Si , v) = Sj which means the transition from state Si to state Sj by reading the symbol v.
*Questions:
1)Show how one can proceed to obtain the finite state automaton, resulting from the application of each operation on the finite state automata.
2)Now apply each operation on finite state automata of your choice, determining the resulting automaton.
3)Determine the finite state automaton resulting from the application of the inverse (mirror) operation on a finite state automaton, which recognizes a language containing the empty word.

[@mandasisters3539]

Tq so much for ur videos sir .
I hav scored 50 marks with in 1 day before exam

[@beautifullifejourney28liza]

Well explained sir

[@arungujjar7328]

Sir please make more videos on DS Algo in python, ur linked list in python videos are very very helpful 🙌

[@gopalahs7904]

Highly recommended

[@surusustasi]

helal olsun hocam, bizim hocadan iyi anlatıyorsun

[@sanas.193]

Thank you so much

[@computerscience7078]

Thank you so much sir 🙏 😊

[@AnanduS-z9l]

thank you ❤

[@samratyadav6421]

Sir please provide whole automata

[@SarahKT]

sir, thanks for providing these classes but i can't seem to find moore and melay machine videos..???

[@Abhisekko]

same

[@sleeve.3995]

thanks!!!

[@abebechamo1472]

nice

[@shaiksalmanbasha396]

Notes also provide sir

[@miteshshetye99]

anyone plz give module wise videos

[@Gilbertjohn-g5l]

Sir, characteristics of automata ??

[@shashikantabhagat7054]

Pls Make video on Android

[@thalapathi067]

Sir I need flat r20 notes pdf sir

[@aegonthegamer5916]

time taken to complete this playlist?

[@kanthisriakula8946]

Less than 3 hours like maybe 2 hours 20 minutes or something like that only if you watch this without taking any breaks

[@saichaithanyakamilikar]

Good explanation sir

[@veenavijayaraghavan8787]

Excellent Sir