Lec-9 : DFA of language with all strings starting with 'a' & ending with 'b' | DFA Example

🔹 Gate Smashers Shorts: Watch quick concepts & short videos here:    / @gatesmashersshorts   🔹 Subscribe for more shorts and motivational content:    / @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 starting with 'a' & ending with 'b' 0:00 - Introduction 1:02 - Write all strings of Language (Starting with 'a' & Ending with 'b') 2:05 - 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)   ►Software Engineering (Complete Playlist):    • Software Engineering   ►Database Management System:    • DBMS (Database Management system) Complete...   ►Artificial Intelligence:    • Artificial Intelligence (Complete Playlist)   ►Computer Networks (Complete Playlist):    • 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   ►Programming in C:    • C Programming   ►Data Structure:    • Data Structure   ►Computer Architecture:    • Computer Organization and Architecture (Co...   ►Graph Theory (Complete Playlist):    • Graph Theory   ►Digital Logic:    • Digital Logic (Complete Playlist)   ►Cloud Computing:    • Cloud Computing (Complete Course)   ►Python for beginners:    • Python for Beginners   ►Microprocessor:    • Microprocessor   ►Data warehouse:    • Data Warehouse & Data Mining   ►Machine learning:    • Machine Learning   ►Python Programming course (With execution):    • Python Programming course (With execution)   ►Cybersecurity & Ethical Hacking:    • Cybersecurity & Ethical Hacking   ----------------------------------------------------------------------------------------------------------------------------------- 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] #TheoryOfComputation #AutomataTheory #TOCByGateSmashers

Lec-10: DFA of language with all strings Not starting with 'a' OR Not ending with 'b' | DFA Example
▶︎

Lec-10: DFA of language with all strings Not starting with 'a' OR Not ending with 'b' | DFA Example

Lec-17: What is NFA in TOC in Hindi | Non Deterministic Finite Automata
▶︎

Lec-17: What is NFA in TOC in Hindi | Non Deterministic Finite Automata

Lec-11: DFA of all binary strings divisible by 3 | DFA Example 5
▶︎

Lec-11: DFA of all binary strings divisible by 3 | DFA Example 5

DFA to Accept Strings Ending with 101 | Construct Deterministic Finite Automata| TAFL |TOC| AKTU
▶︎

DFA to Accept Strings Ending with 101 | Construct Deterministic Finite Automata| TAFL |TOC| AKTU

Lec-15: Minimization of DFA in Hindi with example | TOC
▶︎

Lec-15: Minimization of DFA in Hindi with example | TOC

Lec-12: DFA of all strings in which 2nd symbol is '0' and 4th symbol is '1' | DFA Example 6
▶︎

Lec-12: DFA of all strings in which 2nd symbol is '0' and 4th symbol is '1' | DFA Example 6

Lec-60: Turing Machine for a^nb^n | Design Turing Machine
▶︎

Lec-60: Turing Machine for a^nb^n | Design Turing Machine

Niederlande – Japan Highlights | Gruppe F, FIFA WM 2026 | sportstudio
▶︎

Niederlande – Japan Highlights | Gruppe F, FIFA WM 2026 | sportstudio

This Paradox Splits Smart People 50/50
▶︎

This Paradox Splits Smart People 50/50

Lec-13: DFA for Even a and Even b | Even a Odd b | Odd a and Even b | Odd a Odd b | TOC
▶︎

Lec-13: DFA for Even a and Even b | Even a Odd b | Odd a and Even b | Odd a Odd b | TOC

DFA for the string start with 01 or end with 01 | TOC
▶︎

DFA for the string start with 01 or end with 01 | TOC

Lec-8: DFA Example 2 | DFA of language with all strings end with 'a'
▶︎

Lec-8: DFA Example 2 | DFA of language with all strings end with 'a'

Lec-6: What is DFA in TOC with examples in hindi
▶︎

Lec-6: What is DFA in TOC with examples in hindi

DFA Examples 17 & 18|| Set of all strings Starts with 1 and Ends with 0| Starts with a & Ends with b
▶︎

DFA Examples 17 & 18|| Set of all strings Starts with 1 and Ends with 0| Starts with a & Ends with b

2.10 Every string must start and ends with "a" | TOC | DFA Designing | Theory of Computation
▶︎

2.10 Every string must start and ends with "a" | TOC | DFA Designing | Theory of Computation

Lec-7: DFA Example 1 | How to Construct DFA in TOC
▶︎

Lec-7: DFA Example 1 | How to Construct DFA in TOC

Lec-20: Convert NFA to DFA with example in Hindi | How to Convert NFA to DFA
▶︎

Lec-20: Convert NFA to DFA with example in Hindi | How to Convert NFA to DFA

2.11 Every string must start and ends with same symbol | TOC | Theory of Computation | Automata
▶︎

2.11 Every string must start and ends with same symbol | TOC | Theory of Computation | Automata

Lec-5: What is Grammar in TOC | Must Watch
▶︎

Lec-5: What is Grammar in TOC | Must Watch