423 views

2 Answers

0 votes
0 votes

In these types of questions generally, we have to make the FA with min. state which is equal to the LCM of both the boundary ie.LCM(3,5) this is because we have to take care of different states and cases for 3 the strings must be stopped at the 6th, 9th, 12th &15th state whereas, in the case of 5, the string must be stopped at the 11th, 16th (1st state) and so on.  

So, after the 15th state, a pattern is formed. so, min. no. of states is 15 needed. 

Hope you understand 

Related questions

0 votes
0 votes
1 answer
1
amitarp818 asked Nov 18, 2023
223 views
Given L1 = {a*baa*} and L2 = {ab*}The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
1 votes
1 votes
1 answer
2
Souvik33 asked Dec 4, 2022
332 views
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:TRU...
1 votes
1 votes
1 answer
3
srestha asked Apr 23, 2019
935 views
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________Answer will be...
0 votes
0 votes
1 answer
4