0 votes 0 votes NFA to DFA..no of states answer Ashok asked Feb 4, 2018 Ashok 1.3k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Harsh Mehta commented Feb 4, 2018 reply Follow Share i was confused between 2 option .. one was K>=n and other k<=2^n .. i marked k <= (2^n) 2 votes 2 votes Mr.OOPs commented Feb 4, 2018 reply Follow Share Yes!!@Harsh Mehta you are correct 0 votes 0 votes hsd31196 commented Feb 5, 2018 reply Follow Share It is atleast 2^N. 0 votes 0 votes Prasun Mondal 3 commented Feb 7, 2018 reply Follow Share what if the language have only one terminal symbol? will it be still 2^n?? I doubt! 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes option d $ruthi answered Feb 4, 2018 $ruthi comment Share Follow See 1 comment See all 1 1 comment reply akhilpalla commented Feb 4, 2018 reply Follow Share YES option d 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes It is almost 2n For n states nfa ,1<=dfa<=2n Mohammed Sumair answered Feb 5, 2018 Mohammed Sumair comment Share Follow See all 0 reply Please log in or register to add a comment.
