Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
Two finite state machines are said to be equivalent if they:
1
Have the same number of edges
2
Have the same number of states
3
Recognize the same set of tokens
4
Have the same number of states and edges