Design DFA in which no of a's is multiple of 3 and no of b's is multiple of 2 | TOC | Automata

#dfadesign​, #gatelecture​, #thegatehub​, #toc​
In this video I have discussed about how to construct a minimal DFA that accepts set of all strings over {a,b} in which number of a's is multiple of 3 and number of b's is multiple of 2.

In this video I have discussed about how to construct a minimal DFA that accepts set of all strings over {a,b} in which number of a's is multiple of 3 and number of b's is multiple of 2
Design FA with ∑= {a, b} accepts number of a's is multiple of 3 and number of b's is multiple of 2
Design FA with ∑={0, 1} accepts number of 0's is multiple of 3 and number of 1's is multiple of 2

In this video Theory of Computation Example of Construct DFA for the set of string over {a, b} such that number of a's is multiple of 3 and number of b's is multiple of 2. i.e, Na(W) mod 3 = 0 and Nb(W) mod 2 = 0. this example is solved in detail Sometimes it may be asked like Construct DFA from Regular Expression, This example is solved with detail Explanation, also we have seen DFA in the video of TOC GATE Course , till now we have seen many examples and different topics in our previous videos so if have not watched then take a look at them also our all the future videos will be GATE lectures.
Na(W) mod 3 = 0 and Nb(W) mod 2 = 0
Na(W) mod 3 = 0 or Nb(W) mod 2 = 0
dfa for language number of a's is multiple of 3 and number of b's is multiple of 2
dfa for language number of a's is multiple of 3 or number of b's is multiple of 2
dfa for string number of a's is multiple of 3 and number of b's is multiple of 2
dfa for string number of a's is multiple of 3 and number of b's is multiple of 2
design dfa for language number of a's is multiple of 3 and number of b's is multiple of 2
design dfa for language of (a b) number of a's is multiple of 3 and number of b's is multiple of 2
Construct DFA number of a's is multiple of 3 and number of b's is multiple of 2
construct dfa for language number of a's is multiple of 3 and number of b's is multiple of 2
DFA of strings which number of a's is multiple of 3 and number of b's is multiple of 2
dfa design for string number of a's is multiple of 3 and number of b's is multiple of 2
dfa design for language number of a in |w| is divisible by 3 and number of b in |w| is divisible by 2, dfa for number of a in |w| is divisible by 3 and number of b in |w| is divisible by 2
design dfa for number of a's is multiple of 3 and number of b's is multiple of 2
construct dfa for number of a in |w| is divisible by 3 and number of b in |w| is divisible by 2
How to construct an automata with even number of a's and odd number of b's?
the gatehub,toc gate lectures, gatehub, dfa design, formal language and automata theory, theory of computation,automata theory,automata,computation theory,automata for bigginers,theory of computation for bigginers,automata introduction,toc,toc introduction,finite state machine,turing machine,undecidability,theory of computation lectures,theory of computation for gate,automata lectures,automata theory lectures,automata theory lectures for gate,gate computer science,gate lectures,Deterministic Finite Automata