1 votes 1 votes While constructing state diagram with minimum states, dead state is compulsory for: a) Only DFA b) Only NFA c) Both NFA and DFA d) Neither DFA nor NFA Theory of Computation finite-automata theory-of-computation general + – sh!va asked Mar 10, 2017 sh!va 5.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
6 votes 6 votes Option A because In DFA if we have to reject a string for a particular symbol we will have to design a trap state or dead state for it. In NFA if Dead configuration comes then it means in NFA if we did not mention any transition for a particular symbol and that symbol comes as input then that string will be silently rejected , but this is not allowed in DFA( thats why trap state is there in DFA). Shubham Sharma 2 answered Mar 10, 2017 Shubham Sharma 2 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes only DFA so option a) Rameez Raza answered Mar 29, 2017 Rameez Raza comment Share Follow See all 0 reply Please log in or register to add a comment.