61 theory of computation | dfa construction | minimal dfa on a followed by b |dfa of a followed by b

Welcome to Theory Of Computation(TOC) or Automata Theory(Automata) lecture of Computer Science And IT Gate Coaching.

In this video I have explained:-

dfa construction :- (i)minimal dfa on a followed by b
or
Construct a minimal dfa which accepts set of all strings over {a,b} in which every a is followed by 'b'.
or
construct a dfa which accepts set of all strings over a b in which every ‘a’ is followed by a ‘b’.

Timetable:-
0:10- Construct a minimal DFA which accepts set of all strings over {a,b} in which every a is followed by 'b'.
------------------------------

#TheoryOfComputation
#dfaConstruction
#minimalDfa

Related queries
dfa construction
minimal dfa

Contact Details and Group Details are shown below:-

Contact Number:- 7044331545/7003379518

WhatsApp Number:- 7044331545

Telegram Number:- 7044331545