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 😀
@sheikhrashid30552 жыл бұрын
1:46 Microwave is a word. Microwove is an emotion
@danceflorr67582 жыл бұрын
thank you sir i passed FLAT with ur lectures. Thankyou i taught its an impossible task.
@shashankgaikwad58253 жыл бұрын
Theory of Computation. I was waiting on this sir. Thank you for starting this
@SanjayKumar-ps7jt3 жыл бұрын
Bro Which couse u enrolled now .
@letsgetcopyright2603Ай бұрын
Automata theory TOC -> Theory of computation (processing -> from input to output) A machine used binary (low level lannguage) Input -> Abstract Machine / Model -> Output Example: Off state -> Switch -> On state (owen) Abstract Machine / Model (Automata -> low level implementation ) Finite Automata IF this model / abstract Machine implement a finite number of states called finite Automata . Applications (Uses) (Valid / Invalid ) * Design of Compiler (lexical Analyser) * Pattern Matching (Pass-board picture) * Spell Checker Concepts * Automata (processing -> input to output) * Computing (wether the Machine/Model can process the input or not) * Complexity (Many solution -> optimal solution -> pick less complex solution )
@santoshkar2672 жыл бұрын
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
@mandasisters35392 жыл бұрын
Tq so much for ur videos sir . I hav scored 50 marks with in 1 day before exam
@loveurself013 жыл бұрын
Thank sir I am fan of your videos..
@elho37502 жыл бұрын
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.
@trythis71612 жыл бұрын
All the videos are clearly understood and explanation is good add still more topics in formal language automata theory if possible
@MBindu-kc2nj3 жыл бұрын
Keep on doing sir
@DEVARASIVAYSRCP3 жыл бұрын
Tqs for start this station
@sanas.19311 ай бұрын
Thank you so much
@ravikanth45253 жыл бұрын
Plz make a video on cloud computing sir
@ModernWorld8762 жыл бұрын
Cloud computing gurinchi telugu lo video cheyyandi sir
@abebechamo1472 Жыл бұрын
nice
@surusustasi2 жыл бұрын
helal olsun hocam, bizim hocadan iyi anlatıyorsun
@computerscience70785 ай бұрын
Thank you so much sir 🙏 😊
@veenavijayaraghavan87872 жыл бұрын
Excellent Sir
@SarahKT2 жыл бұрын
sir, thanks for providing these classes but i can't seem to find moore and melay machine videos..???
@Abhisekko Жыл бұрын
same
@arungujjar73283 жыл бұрын
Sir please make more videos on DS Algo in python, ur linked list in python videos are very very helpful 🙌
@gopalahs79043 жыл бұрын
Highly recommended
@AnanduS-z9l Жыл бұрын
thank you ❤
@Gilbertjohn-g5l Жыл бұрын
Sir, characteristics of automata ??
@samratyadav64213 жыл бұрын
Sir please provide whole automata
@thalapathi067 Жыл бұрын
Sir I need flat r20 notes pdf sir
@shaiksalmanbasha3963 жыл бұрын
Notes also provide sir
@sleeve.399510 ай бұрын
thanks!!!
@miteshshetye9910 ай бұрын
anyone plz give module wise videos
@aegonthegamer59168 ай бұрын
time taken to complete this playlist?
@kanthisriakula89468 ай бұрын
Less than 3 hours like maybe 2 hours 20 minutes or something like that only if you watch this without taking any breaks