1 1 vote Theory of Computation finite-automata + – Çșȇ ʛấẗẻ 565 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
2 2 votes PS: ignore my handwriting and image lighting. prajjwal_191 answered Oct 3, 2023 prajjwal_191 comment Share Follow See all 2 Comments 2 2 Comments reply headshot_dead commented Oct 17, 2023 reply Follow flag @prajjwal_191 ,in your 2 nd answer of the question there is slight mistake while designing it cause Q3 must have 0 as self loop otherwise 010 string is getting rejected which need to be accepted. 0 0 replyShare prajjwal_191 commented Oct 18, 2023 reply Follow flag @headshot_dead ohh yes I made a mistake there but keeping self loop on Q3 will not make it correct because then strings like 010101 will not be accepted. So we can take 2 more final states Q5 and Q6 and then make transition like Q3 to Q5 on 0, Q5 to Q3 on1, Q5 to Q6 on 0,Q6 to Q5 on 0 and Q6 to Q3 on 1. 1 1 replyShare Please log in or register to add a comment.