0 0 votes 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,1 Please also construct dfa Theory of Computation + – prashant dubey 645 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply manisha11 commented Apr 27, 2019 reply Follow flag 4? 1 1 replyShare prashant dubey commented Apr 27, 2019 reply Follow flag is it possible that we can construct dfa by using 3 state ????? 0 0 replyShare srestha commented Apr 27, 2019 reply Follow flag no.. 1 1 replyShare Please log in or register to add a comment.
