283 views
0 votes
0 votes
. Construct the minimal finite automata that accept all the strings of 0’s and 1’s where the integer equivalent of the binary string is congruent to 3 mod 6. What is the no. of states in the minimal finite automata?

1 Answer

1 votes
1 votes
no of states in minimal finite automata =4

here it is mod 6= 6/2=3

here no of states = 3+1

Related questions

0 votes
0 votes
0 answers
1
prashant dubey asked Apr 27, 2019
257 views
The minimum no. of states required to construct DFA which can accept length of the string is devisable by 4 where input string is 0,1Please also construct dfa
0 votes
0 votes
2 answers
2
altamash asked Dec 25, 2018
243 views
{w1 x w2|w1,x,w2∈(a+b)*,w1=w2}it is regular ?????
0 votes
0 votes
0 answers
3
altamash asked Dec 25, 2018
187 views
explain why it is CFL?
0 votes
0 votes
1 answer
4
altamash asked Sep 21, 2018
271 views
what is minimum number of states of NFA which accepts language{abab^n|n>=0} U{aba^n|n>=0}