2 votes 2 votes For drawing the DFA for right quotient I have referred following link:- Ref :- https://www.seas.upenn.edu/~cit596/notes/dave/closure5.html But unable to get the dfa for the following language Its answer is c, and got that too using manual checking. but facing difficulty in drawing DFA for it. Theory of Computation theory-of-computation regular-language finite-automata + – Shubhanshu asked Oct 31, 2017 Shubhanshu 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L1=bba*baa* L2=(ab)* L1/l2=bba*ba* Now check DFA for that (if you face difficult create direct DFA then first create NFA and convert it into DFA(it also give minimal DFA)) Bhargav D Dave 6 answered Nov 1, 2017 Bhargav D Dave 6 comment Share Follow See 1 comment See all 1 1 comment reply Shubhanshu commented Nov 1, 2017 reply Follow Share You are probably doing Step1> Manually finding Reg Exp. Step2> Creating DFA for that Regular Expression. But my question is, in the above ref link https://www.seas.upenn.edu/~cit596/notes/dave/closure5.html they have provided an algorithm for drawing L1/L2 DFA directly. They are following steps as:- Step1> Get the DFA of L1/L2. Step2> Get the Reg expression from that DFA. 0 votes 0 votes Please log in or register to add a comment.