

InterviewSolution
Saved Bookmarks
1. |
Which of the following conversion is not feasible?(a) Regular expression to automaton conversion(b) Automaton to Regular Expression Conversion(c) NFA to DFA(d) None of the mentionedI had been asked this question in an internship interview.The doubt is from Conversions among Representations topic in chapter Properties of Regular Languages of Automata Theory |
Answer» RIGHT option is (d) None of the mentioned Best explanation: Each of the four FORMATS of representation of the REGULAR language be it, DFA, NFA, Regular Expression or e-NFA can be converted to the rest three forms. |
|