0 votes 0 votes What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of string is not congruent to 0 (mod 4). A. 7 B. 6 C. 3 D. 5 Theory of Computation regular-expression theory-of-computation finite-automata regular-language + – Shashi Shekhar 1 asked Sep 2, 2017 Shashi Shekhar 1 872 views answer comment Share Follow See 1 comment See all 1 1 comment reply Manu Thakur commented Sep 3, 2017 reply Follow Share I am getting 3 as answer. there will be 3 final states in DFA. 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes There are 3 final states in the DFA. Manu Thakur answered Sep 3, 2017 Manu Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.