3.55 (67 reviews)
☑ How Machines make Decisions
☑ Define Languages descriptively and recursively
☑ Create Deterministic Finite Automatan ( DFA ) , Transtition Graph ( TG) , Generalized Transition Graph ( GTG )
☑ Depict Languages through Regular Expression ( RE )
☑ Create Nondeterministic Finite Automatan ( NFA )
☑ Convert NFA to DFA
☑ Generate Context Free Language (CFL) through Context Free Grammar (CGL)
☑ Express Language words through Trees
☑ and Much More!
This is the most comprehensive course available on Udemy touching on this subject matter and the only course to cover such a large portion of this subject . ( At the time of posting )
This course is designed to provide the student with an opportunity to gain or enhance the basic concepts of Automata. The purpose of this course is to equip you with the tools that will help you understand advanced topics without the help of a teacher
Or If you are taking an Automata course in your university / College, this course will make sure that you pass with flying colors and stay at the top of your class
We'll take you step-by-step through engaging video tutorials and teach you everything you need to know
Why take this course ?
A survey of Stanford grads 5 years out asked which of their courses did they use in their job. Basics like Programming took the top spots, of course. But among optional courses, Automata Theory stood remarkably high (3X the score for AI, yeah this high)
Can you hear that noise? It is the sound of a thousand brilliant theorems, applications and tools laughing in automata-theoretic heaven.
Languages and automata are elegant and robust concepts that you will find in every area of computer science
Languages and automata theory, besides an insane number of practical applications, provide a very significant intellectual service. We can think about problems ranging from formatting zip codes to decision procedures for monadic second order logic in uniform and uncluttered conceptual space. How amazing is that!
Don't worry the Course will be very simple and Easy to follow through
Why this course?
What is Automata ?
Automata Definition , Language Fundamentals , Defining Languages
Descriptive Definition of Language
Defining Languages Descriptively
Recursive Definition of Languages
Kleen Star Closure and Kleen Plus
Defining Languages Recursively
Regular Expression ( RE )
What is Regular Expression ( RE ) ?
Defining Languages by Regular Expression ( RE )
Equivalent Regular Expression and misconceptions
Is Regular Expression ( REGEX ) worth the hassle ?
Finite Automaton ( FA )
Finite Automaton , Transition table and Transition diagram
Some More Examples
FA corresponding to Finite Languages
Transition Graph ( TG )
Transition Graph and some Examples
Some more Languages
Generalized Transition Graph ( GTG )
Generalized Transition Graph and examples
Nondeterministic Finite Automaton ( NFA )
Nondeterminism and Nondeterministic Finite Automaton
Converting NFA to DFA
Context Free Grammar ( CFG ) and Context Free language ( CFL )
Context Free Grammar , CFG Terminologies
Context Free Language (CFL) and examples
Ambiguous & Unambiguous CFG
Total language tree
A very short course. I Undtrstood that it was the main idea - but it`s to short + a lot of examples a have seen a plenty of times. I hope that this course hellped to smb, but for me it doesn`t helped
i wish there were more exercise so i could practice before the assigment. or practice what i had learnt.
This course is a life saver. I bought this course 2 weeks before my final exam and I can easily say that I aced my exam just because of this course. The Course starts from the basics everything you need to know is already present in the course. It does not require you to have any prerequisite knowledge which makes it extremely suitable for the beginners. The accent, pace and delivery is perfect. Usman is very responsive to queries, I had 3 queries and Usman responded to them in extremely detailed manner.
We have learnt Formal languages 'n' Automatons from a book during Cold War: Demetrovics-Denev-Pavlov, but these lectures is better than this book. Why? It is practically and The Importance is in it and in details.
A very basic course on Formal Language. The contents mostly include definition and examples on the topics listed in the description of this course.
The course makes the concepts easier to understand through his lectures being very detailed and specific. I also appreciate that the course has examples which does indeed help in making things crystal clear.
This course is a short and sweet introduction to the basics of automata. It won't teach you advanced topics but does serve as a decent foundation for exploring the topic further. I'd recommend this course as a primer for anyone studying the foundations of computation at school/university, or even as a supplement. - Usman is very responsive and quick to explain concepts further if needed. - The accent is NOT difficult to understand at all. Further, Usman speaks good English. - The accompanying notes are concise and to-the-point. I prefer these notes to the slideshow handouts which some courses provide. - I completed the course over a few evenings, and feel suitably prepared to explore automata further. Thanks Usman!
excellent teaching and the lectures are exactly according to the need of student,major things covers in a very short time..