Construct a minimal DFA which contains set of string in which every 'a' is followed by a 'bb' | TOC

Problem Statement:
1) Construct a minimal DFA which contains a set of string in which every 'a' is followed by a 'bb' over the input alphabet { a, b }.
2) Construct a minimal DFA which contains a set of string in which every 'a' should never be followed by a 'b' over the input alphabet { a, b }.
Computer Graphics Playlist:-
• Computer Graphics
Compiler Design Playlist:-
• Compiler Design
Design and Analysis of Algorithm Playlist:-
• Design and Analysis of...
Sorting Techniques Playlist: -
• Sorting Techniques
Computer Network Playlist: -
• Data Communication and...
Theory of Computation Playlist: -
• Theory Of Computation ...
Please like this video and subscribe to my channel if you guyies have got any doubt you can ask them in comment section down below or you can send me it on my social media handles or you can also mail me.
Gate previous year questions & Practice Questions are also there in this particular course
Please subscribe the channel and drop a like for more quality content and educational videos.
#TheoryOfComputation #TOCBySmartButClever #automatatheory
#smartbutcleverAn introduction to the subject of Theory of Computation and Automata Theory Course,.