Register

made easy test series 2023 toc question

431 views

1 Answer

3 votes
3 votes

For this, we have to calculate no of states of these two DFA separately, then we have to multiply it, and it will give minimum numbers of states for the given DFA. 

 

$(\ No. \ of \ 0's \ div \ by \ 2\ ) * ( \ No. \ of \ 1's \ div \ by \ 7 \ )$

= $(\ N₀\ mod \ 2 \ ) \ * \ (\ N₁ \ mod \ 7\ )$

= { $0, 1$ } $*$ { $0, 1, 2, 3, 4, 5, 6$ }     [ As Mod 2 gives 0, 1 as remainder and mod 7 gives 0 to 6 as remainder ]

= $2 * 7$

= $14$

No. of states will be: $14$

 

Good read : 

1.  Gate Cse 2001 - Min no of states in DFA

2.  Minimal Deterministic Finite Automata

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

409
views
1 answers
1 votes
Souvik33 asked Dec 4, 2022
409 views
TOC | Made Easy Test Series | Q.13
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRUEFALSE
User Avatar
639
views
1 answers
0 votes
srestha asked May 2, 2019
639 views
Made Easy Test Series:TOC
The number of distinct 1 letter subword present in “NAMITA” is equal to_______________Answer given subwords are N,A,M,I,TBut last ‘A’ is not a subword. Is it correct??
User Avatar
1.1k
views
2 answers
3 votes
srestha asked Apr 30, 2019
1,136 views
Made Easy Test Series:TOC-Turing Machine
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length}$P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length ... $M$ halts }The number of problem which is $RE$ but not $REC$ _____________
User Avatar
735
views
0 answers
0 votes
srestha asked Apr 23, 2019
735 views
Made Easy Test Series: TOC
The pushdown automata ... transition going from $q_{2}$ to $q_{0}$ and not $q_{0}$ to $q_{2}$Am I right?
User Avatar
Link Copied!