Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the language L given by (assume Σ = { 2 } )
L = {2nk | k > 0, and n is non − negative integer number}
The minimum number of states of finite automaton which accept the language L is1
n
2
n + 1
3
2n
4
n(n + 1)/2