1 votes 1 votes Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4). Theory of Computation theory-of-computation minimal-state-automata finite-automata number-of-states + – kislaya Pant asked May 8, 2018 kislaya Pant 1.1k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Ananya Jaiswal 1 commented May 8, 2018 reply Follow Share i'm getting 3 final states. what is the correct answer? 0 votes 0 votes akash.dinkar12 commented May 8, 2018 reply Follow Share @Ananya Jaiswal 1 how 3 final states?? 0 votes 0 votes kislaya Pant commented May 8, 2018 reply Follow Share yes you are correct 3 is the correct 0 votes 0 votes Harshitha 123 commented Jun 14, 2018 reply Follow Share How is it 3 states I am getting total of 7 states of which 4 final states, 2 non final and 1 trap state?(correct me if I am wrong) 0 votes 0 votes Harshitha 123 commented Jun 14, 2018 reply Follow Share I got clarified I made 2nd state (after accepting 1 a ) as final state which is wrong 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes see this dfa. let me know if i'm wrong Ananya Jaiswal 1 answered May 8, 2018 Ananya Jaiswal 1 comment Share Follow See 1 comment See all 1 1 comment reply Kumar Iyer commented May 9, 2018 reply Follow Share 1. Write transition table for congruent mod4 2. Apply complementation and then minimization 0 votes 0 votes Please log in or register to add a comment.