0 votes 0 votes What will be the number of final and non-final states for the minimal DFA accepting the language which contains all the strings that either begin or end (or both) with 01? Can anyone provide the DFA diagram for this? atul_21 asked Dec 22, 2017 atul_21 1.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply shariq1 commented Jun 3, 2021 reply Follow Share Is this also correct? It has only 1 final state. 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes There will total 6 states, final states 2, non-final states 4 The upper part is for starting with 01, lower part is for ending with 01 Ashwin Kulkarni answered Dec 22, 2017 • selected Dec 22, 2017 by atul_21 Ashwin Kulkarni comment Share Follow See all 2 Comments See all 2 2 Comments reply atul_21 commented Dec 22, 2017 reply Follow Share Thank you so much @ Ashwin Kulkarni 1 votes 1 votes Learner_jai commented Jan 31, 2018 reply Follow Share Ashwin Kulkarni Sir, same as contain substring 01 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes dfa can contain 3 states because in question both is mentioned. Please correct me if I amwrong mahak Sharma answered Jan 6, 2020 mahak Sharma comment Share Follow See 1 comment See all 1 1 comment reply vippsrai commented Mar 12, 2020 reply Follow Share bro string 000111010 can be made from ur DFA which is invalid string for above language.... 0 votes 0 votes Please log in or register to add a comment.
