1 votes 1 votes Consider the DFA M : Number of distinct strings of length $3$ such that $\delta(q_{0},w) = q_{0}$ $10$ $14$ $18$ $20$ Theory of Computation theory-of-computation finite-automata + – shivanisrivarshini asked Mar 7, 2018 • edited Mar 14, 2018 by Sukanya Das shivanisrivarshini 462 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Tarun kushwaha 1 commented Mar 7, 2018 reply Follow Share i think 3 length string can only be 000. 1 votes 1 votes Sukanya Das commented Mar 7, 2018 reply Follow Share I'm also thinks so 0 votes 0 votes Mk Utkarsh commented Mar 7, 2018 reply Follow Share options are not correct 1 votes 1 votes Sukanya Das commented Mar 7, 2018 reply Follow Share Except 000 no other 3 length string is going to $q_0$ 1 votes 1 votes srestha commented Mar 7, 2018 reply Follow Share where is final state? 0 votes 0 votes shivanisrivarshini commented Mar 7, 2018 reply Follow Share Yes even I think same only 1 string 000 Given Options are wrong 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes The only possible string according to the constraint in the question is 000. (String of length 3) Junaed Siddiquee answered Mar 7, 2018 Junaed Siddiquee comment Share Follow See all 0 reply Please log in or register to add a comment.
