BANK IBPS SO Mock Test (Pre + Mains) 2024 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
5
None of the above