0 votes 0 votes Construct the Minimum FA that accepts all the string of 0's and 1's where A)Every String start and end with Zero. B)Every string Start and end with Same Symbol. Theory of Computation finite-automata theory-of-computation minimal-state-automata number-of-states + – suraj patel asked Jul 10, 2018 suraj patel 2.6k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply goxul commented Jul 10, 2018 i edited by goxul Jul 10, 2018 reply Follow Share You can do it by construction the regular expression for the FA. For the first, it will be: 0(0+1)*0 + 0 For the second, it will be: 0(0+1)*0 + 1(1+0)*1 + 0 + 1 0 votes 0 votes suraj patel commented Jul 10, 2018 reply Follow Share Can you please give the State Diagram 0 votes 0 votes goxul commented Jul 10, 2018 reply Follow Share What have you tried? If you show where you are stuck, maybe other people can help you. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Starting and ending with symble 0 Starting and endin with same symble abhishekmehta4u answered Jul 10, 2018 • edited Jul 10, 2018 by abhishekmehta4u abhishekmehta4u comment Share Follow See all 15 Comments See all 15 15 Comments reply Show 12 previous comments suraj patel commented Jul 13, 2018 reply Follow Share ok, let's think about some regular expression rules. 1) 0ε=0=ε0 suppose if we replace ε by a or b or c 0a=a or a=a0 ? 0 votes 0 votes raviranjans821 commented Jul 15, 2018 reply Follow Share can you perform 1st part using concatenation. please show me. 0 votes 0 votes Shaik Masthan commented Jul 27, 2018 reply Follow Share @suraj patel, my intension is not querying with you... if you are saying ∈ also in Language then, starting and ending with 1 also should be in language due to 1 = ∈ . 1 . ∈ 11 = ∈ . 11 . ∈ if you are not getting comment one more time.... 0 votes 0 votes Please log in or register to add a comment.