#TheoryOfComputation #AutomataTheory #TOCByGateSmashers
👉Subscribe to our new channel: / @varunainashots
In the video, Varun Sir has explained an example of a DFA. Design a DFA over the alphabet {a, b} that recognizes a language consisting of all strings containing at least one 'a'.
0:00 - Introduction
0:55 - Write all strings of Language (Contains 'a')
1:44 - Design DFA for the above language
►Theory of Computation (Complete Playlist):
• TOC(Theory of Computation)
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
• Design and Analysis of algorithms (DAA)
►Database Management System:
• DBMS (Database Management system) Com...
► Software Engineering:
• Software Engineering
►Artificial Intelligence:
• Artificial Intelligence (Complete Pla...
►Computer Networks:
• Computer Networks (Complete Playlist)
►Operating System:
• Operating System (Complete Playlist)
►Structured Query Language (SQL):
• Structured Query Language (SQL)
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Complete Playlist)
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG Data
►Programming in C :
• C Programming
►Data Structure:
• Data Structure
►Computer Architecture :
• Computer Organization and Architectur...
►Graph Theory (Complete Playlist):
• Graph Theory
►Digital Logic:
• Digital Logic (Complete Playlist)
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on YouTube: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: https://t.me/gatesmashersofficial
► Follow us on Threads: https://www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: [email protected]
On this page of the site you can watch the video online Lec-7: DFA Example 1 | How to Construct DFA in TOC with a duration of hours minute second in good quality, which was uploaded by the user Gate Smashers 21 March 2020, share the link with friends and acquaintances, this video has already been watched 1,103,050 times on youtube and it was liked by 18 thousand viewers. Enjoy your viewing!