Question: Answer these two questions i) Convert the regular Expression into Finite automata (1+0)011(1+0) Using direct and subset construction method and convert the finite automata into
i) Convert the regular Expression into Finite automata (1+0)011(1+0) Using direct and subset construction method and convert the finite automata into Regular Expression using equation ,Ardens and state elimination methods ii) Draw the DFA and NFA and convert the NFA into DFA for the given string using Myhill method and equation method for the any string with "tion" as end
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
