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

  Рет қаралды 245,090

Sundeep Saradhi Kanthety

Sundeep Saradhi Kanthety

Күн бұрын

Пікірлер: 37
@satish537
@satish537 2 жыл бұрын
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
@bluedip Жыл бұрын
But how much you get 😀
@sheikhrashid3055
@sheikhrashid3055 2 жыл бұрын
1:46 Microwave is a word. Microwove is an emotion
@danceflorr6758
@danceflorr6758 2 жыл бұрын
thank you sir i passed FLAT with ur lectures. Thankyou i taught its an impossible task.
@shashankgaikwad5825
@shashankgaikwad5825 3 жыл бұрын
Theory of Computation. I was waiting on this sir. Thank you for starting this
@SanjayKumar-ps7jt
@SanjayKumar-ps7jt 3 жыл бұрын
Bro Which couse u enrolled now .
@letsgetcopyright2603
@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 )
@santoshkar267
@santoshkar267 2 жыл бұрын
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
@mandasisters3539
@mandasisters3539 2 жыл бұрын
Tq so much for ur videos sir . I hav scored 50 marks with in 1 day before exam
@loveurself01
@loveurself01 3 жыл бұрын
Thank sir I am fan of your videos..
@elho3750
@elho3750 2 жыл бұрын
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.
@trythis7161
@trythis7161 2 жыл бұрын
All the videos are clearly understood and explanation is good add still more topics in formal language automata theory if possible
@MBindu-kc2nj
@MBindu-kc2nj 3 жыл бұрын
Keep on doing sir
@DEVARASIVAYSRCP
@DEVARASIVAYSRCP 3 жыл бұрын
Tqs for start this station
@sanas.193
@sanas.193 11 ай бұрын
Thank you so much
@ravikanth4525
@ravikanth4525 3 жыл бұрын
Plz make a video on cloud computing sir
@ModernWorld876
@ModernWorld876 2 жыл бұрын
Cloud computing gurinchi telugu lo video cheyyandi sir
@abebechamo1472
@abebechamo1472 Жыл бұрын
nice
@surusustasi
@surusustasi 2 жыл бұрын
helal olsun hocam, bizim hocadan iyi anlatıyorsun
@computerscience7078
@computerscience7078 5 ай бұрын
Thank you so much sir 🙏 😊
@veenavijayaraghavan8787
@veenavijayaraghavan8787 2 жыл бұрын
Excellent Sir
@SarahKT
@SarahKT 2 жыл бұрын
sir, thanks for providing these classes but i can't seem to find moore and melay machine videos..???
@Abhisekko
@Abhisekko Жыл бұрын
same
@arungujjar7328
@arungujjar7328 3 жыл бұрын
Sir please make more videos on DS Algo in python, ur linked list in python videos are very very helpful 🙌
@gopalahs7904
@gopalahs7904 3 жыл бұрын
Highly recommended
@AnanduS-z9l
@AnanduS-z9l Жыл бұрын
thank you ❤
@Gilbertjohn-g5l
@Gilbertjohn-g5l Жыл бұрын
Sir, characteristics of automata ??
@samratyadav6421
@samratyadav6421 3 жыл бұрын
Sir please provide whole automata
@thalapathi067
@thalapathi067 Жыл бұрын
Sir I need flat r20 notes pdf sir
@shaiksalmanbasha396
@shaiksalmanbasha396 3 жыл бұрын
Notes also provide sir
@sleeve.3995
@sleeve.3995 10 ай бұрын
thanks!!!
@miteshshetye99
@miteshshetye99 10 ай бұрын
anyone plz give module wise videos
@aegonthegamer5916
@aegonthegamer5916 8 ай бұрын
time taken to complete this playlist?
@kanthisriakula8946
@kanthisriakula8946 8 ай бұрын
Less than 3 hours like maybe 2 hours 20 minutes or something like that only if you watch this without taking any breaks
@shashikantabhagat7054
@shashikantabhagat7054 3 жыл бұрын
Pls Make video on Android
@beautifullifejourney28liza
@beautifullifejourney28liza 2 жыл бұрын
Well explained sir
@saichaithanyakamilikar
@saichaithanyakamilikar 2 жыл бұрын
Good explanation sir
小丑教训坏蛋 #小丑 #天使 #shorts
00:49
好人小丑
Рет қаралды 54 МЛН
1. Introduction to Automata theory
12:16
CSE GURUS
Рет қаралды 225 М.
REGULAR EXPRESSIONS IN AUTOMATA THEORY || REGULAR EXPRESSION WITH EXAMPLE || TOC
13:45
Introduction to Theory of Computation
11:35
Neso Academy
Рет қаралды 3,4 МЛН
MINIMIZATION OF DFA WITH EXAMPLE IN AUTOMATA THEORY || DFA MINIMIZATION || TOC
19:28
Sundeep Saradhi Kanthety
Рет қаралды 105 М.
PUSHDOWN AUTOMATA (PDA) IN AUTOMATA THEORY || PDA INTRODUCTION || WHAT IS PDA ?
11:42