Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the following finite automata F1 that accepts a language L
Let F2 be a finite automata which is obtained by reversal of F1. Then which of the following is correct?
1
L(F1) ≠ L(F2)
2
L(F1) = L(F2)
3
L(F1) ≤ L(F2)
4
L(F1) ≥ L(F2)