Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
For the given two machines which of the following is correct?
1
both Machines are DFAs
2
both are non-equivalent Machines
3
both are equivalent Machines
4
cannot be determined