0 votes 0 votes I read the foll statement somewhere.. Is it true? In nfa if there is a dead configuration then its equivalent dfa may or may not have trap state. Acc to me it will always have a trap state for that particular nfa. ?? Theory of Computation theory-of-computation finite-automata + – Chetnawadhwa asked Nov 7, 2016 Chetnawadhwa 414 views answer comment Share Follow See 1 comment See all 1 1 comment reply Pankaj Joshi commented Nov 7, 2016 reply Follow Share I also agree with you 0 votes 0 votes Please log in or register to add a comment.
