engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
What will be number of non final states in Minimum NFA for the language
L = {w ∈ Σ∗| w ends with 00}Enter numerical value using the virtual keypad. Round off where necessary.