engineering recuitment ISRO Scientist Computer Science Mock Test Theory of Computation Regular Languages and Finite Automata Finite Automata
Number of states in DFA accepting the following language is:
L = { an b2m | n, m ≥ 1 }1
n
2
5
3
m
4
2
Number of states in DFA accepting the following language is:
L = { an b2m | n, m ≥ 1 }