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

INTRODUCTION TO AUTOMATA THEORY
1.What is Automata
2.What is Finite Automata
3.Applications

---------------------------------------------------------------------------------------------------------------
AUTOMATA THEORY || THEORY OF COMPUTATION

COMPILER DESIGN

DATABASE MANAGEMENT SYSTEM

DATA STRUCTURES

JAVA PROGRAMMING

R PROGRAMMING

HTML TUTORIALS WITH IMPLEMENTATION || LEARN HTML IN 4 HOURS

LEARN CSS IN 3 HOURS || CASCADING STYLE SHEETS FOR BEGINNERS

JAVA SCRIPT FOR BEGINNERS IN 7 HOURS || LEARN JAVA SCRIPT IN 7 HOURS || JAVA SCRIPT

XML (eXtensible Markup Language)

OPERATING SYSTEM

ETHICAL HACKING

VI EDITOR BASICS IN LINUX / UNIX || LEARN VI EDITOR COMMANDS || LINUX || UNIX

HOW TO DOWNLOAD & INSTALL MySQL IN WINDOWS 10

PYTHON PROGRAMS

C PROGRAMMING

CORE JAVA TUTORIAL FOR BEGINNERS || LEARN CORE JAVA IN 15 HOURS || JAVA TUTORIALS FOR BEGINNERS

PYTHON TUTORIALS FOR BEGINNERS (తెలుగు లో)

PYTHON OOPS - MODULES - EXCEPTION HANDLING (తెలుగు లో)

PYTHON NUMPY TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE NUMPY TUTORIALS IN TELUGU

PYTHON PANDAS TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE PANDAS TUTORIALS IN TELUGU || DATA SCIENCE

MATPLOTLIB LIBRARY - PYTHON PROGRAMMING (ENGLISH)

PYTHON DATABASE CONNECTIVITY - MYSQL & MS-EXCEL

DATA STRUCTURES USING PYTHON (ENGLISH)

----------------------------------------------------------------------------------------------

[satish]

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!

[sheikhrashid]

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

[shashankgaikwad]

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

[santoshkar]

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

[danceflorr]

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

[elho]

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.

[mandasisters]

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

[trythis]

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

[ravikanth]

Plz make a video on cloud computing sir

[surusustasi]

helal olsun hocam, bizim hocadan iyi anlatıyorsun

[arungujjar]

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

[SarahKT]

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