0 votes 0 votes Theory of Computation regular-language + – tesfaye asked Dec 19, 2022 recategorized Dec 19, 2022 by makhdoom ghaya tesfaye 577 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Sunnidhya Roy commented Dec 20, 2022 reply Follow Share Draw the DFA for L = {a^n | n>=0, n = 3}, It will have 5 states with 4th state as the Final state. Now take L’(Final state → Non Final state and Non Final state → Final State) to get the Language you have mentioned i.e L’ = {a^n | n>=0,n!=3}. 0 votes 0 votes Hira Thakur commented Dec 21, 2022 reply Follow Share is it $a^n$ or $an?$ 0 votes 0 votes Sunnidhya Roy commented Dec 21, 2022 reply Follow Share I guess it’s a^n only. Otherwise if its an then Alphabet set Sigma would be infinite ={ a, 0, 1, 2, 4,…….} 0 votes 0 votes Please log in or register to add a comment.