0 votes 0 votes Convert to a DFA the following NFA$:$ Theory of Computation ullman theory-of-computation finite-automata + – admin asked Apr 2, 2019 • edited Apr 5, 2019 by Lakshman Bhaiya admin 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes yes we can convert into dfa abhishekmehta4u answered Apr 3, 2019 abhishekmehta4u comment Share Follow See all 2 Comments See all 2 2 Comments reply altamash commented Apr 4, 2019 reply Follow Share why you have not taken union between {p,q} in 2nd line {p,q}-0={p,q,r}and {p,q}-1={p,r} 0 votes 0 votes omzzz commented Oct 7, 2020 reply Follow Share @abhishekmehta4u for [{p,q},1] = [{p},1] union [{q},1] = {p,r} 0 votes 0 votes Please log in or register to add a comment.