0 votes 0 votes Convert the following NFA to a DFA and informally describe the language it accepts. Theory of Computation ullman theory-of-computation finite-automata + – admin asked Apr 2, 2019 • edited Apr 5, 2019 by Lakshman Bhaiya admin 2.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes yes can convert into dfa abhishekmehta4u answered Apr 3, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.