0 votes 0 votes Ques:- How to create minimal DFA over w where w belongs to (a,b)* such 2nd symbol from RHS should be 'a'? Theory of Computation theory-of-computation minimal-state-automata finite-automata + – kislaya Pant asked May 5, 2018 kislaya Pant 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes 4 states is required. abhishekmehta4u answered May 6, 2018 abhishekmehta4u comment Share Follow See all 5 Comments See all 5 5 Comments reply kislaya Pant commented May 8, 2018 reply Follow Share Hi Abhishek, Thanks for your solution but just I had one doubt Why in NFA diagram we are not having any transition for a,b means why it is 'phi'. Thanks 0 votes 0 votes abhishekmehta4u commented May 8, 2018 reply Follow Share Regular expression to nfa conversion is easy . And we can easylly convert nfa to dfa . R.E------> nfa-------> dfa 1 votes 1 votes Kumar Iyer commented May 9, 2018 reply Follow Share The minimum number of states required in a minimal dfa for a string with nth symbol from RHS will be 2n. So in this case second symbol from RHS will give 4 states 0 votes 0 votes kislaya Pant commented May 9, 2018 reply Follow Share Thanks For your time :) 0 votes 0 votes zerocod3r commented Jul 15, 2018 reply Follow Share In NFA at state C we do not have any path for inputs a or b, hence "phi" is taken as empty or none value. 0 votes 0 votes Please log in or register to add a comment.