3 votes 3 votes Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are: A NFA – 3, DFA – 4 B NFA – 3, DFA – 3 C NFA – 3, DFA – 3 D NFA – 4, DFA – 4 Theory of Computation theory-of-computation number-of-dfa finite-automata + – Deepthi_ts asked Apr 17, 2017 Deepthi_ts 4.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
5 votes 5 votes NFA - 3 ,DFA - 4 akash.dinkar12 answered Apr 17, 2017 edited Apr 17, 2017 by Prashant. akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.