engineering recuitment Beltron Programmer Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Finite Automata
What is the relation between DFA and NFA on the basis of computational power?
1
DFA > NFA
2
NFA > DFA
3
Equal
4
Can’t be said