Theory of Computation and Automata Theory ( Full Course )

About course : We begin with a study of finite automata and the languages they can define (the so-called "regular languages." Topics include deterministic an...

Nerd's lesson48.4K views11:38:44

🔥 Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Pakistan under the topic 'bigg boss 19 full episode'.

About this video

About course : We begin with a study of finite automata and the languages they can define (the so-called "regular languages." Topics include deterministic and nondeterministic automata, regular expressions, and the equivalence of these language-defining mechanisms. We also look at closure properties of the regular languages, e.g., the fact that the union of two regular languages is also a regular language. We consider decision properties of regular languages, e.g., the fact that there is an algorithm to tell whether or not the language defined by two finite automata are the same language. Finally, we see the pumping lemma for regular languages - a way of proving that certain languages are not regular languages. ⭐⭐⭐⭐🕑TIME STAMP📋⭐⭐⭐⭐⭐ 0:00:00 Course outline and motivation 0:14:56 Informal introduction to finite automata 0:26:07 Deterministic finite automata 1:02:01 Nondeterministic finite automata 1:47:50 Regular expression 2:26:04 Regular Expression in the real world 2:42:39 Decision expression in the real world 3:23:57 Closure properties of regular language 3:44:20 Introduction to context free grammars 4:11:23 Parse trees 4:37:28 Normal forms for context free grammars 5:04:55 Pushdown automata 5:28:47 Equivalence of PDAs and CFGs 5:47:10 The pumping lemma for CFLs 5:59:18 Decision and closure properties for CFLs 6:34:31 Turing machines 7:08:37 Extensions and properties of turing machines 7:45:54 Decidability 8:04:18 Specific indecidable problems 9:00:11 P and NP 9:25:36 Satisfability and cooks theorem 10:09:33 Specific NP-complete problems 10:42:14 Problem Session 1 10:57:18 Problem Session 2 11:06:49 Problem Session 3 11:29:06 Problem Session 4 ♥️♥️Thanks for watching don't forget to like and Subscribe♥️♥️ ⌨️ This course is created in collaboration with Stanford University. ✨✨PLEASE IGNORE THESE TAGS✨✨ #theoryofcomputationcourse, theory of computation problems and solutions pdf, theory of computation solutions, theory of computation and automata, #theoryofcomputationcomputerscience, theory of computation theory of computation course online, #theoryofcomputationcrashcourse, theory of computation full course, theory of computation finite automata, theory of computation formal language, #theoryofautomata ------------------------------------------------------------------------------------------------------------------------------------- If you realllly enjoy my content, you're welcome to support me and my channel with a small donation via PayPal 👉Link to PayPal donation: https://www.paypal.me/nerdslesson

Video Information

Views
48.4K

Total views since publication

Likes
1.3K

User likes and reactions

Duration
11:38:44

Video length

Published
Feb 27, 2022

Release date

Quality
sd

Video definition