finite automata - Checking if a Language is Regular -
when asked prove language regular, start?
what methods have prove language regular?
language {a^n | n<>2 , n<>≡ 3(mod 7)}
as hint: if make cycle of 7 states linked in ring , number them 0, 1, 2, 3, ..., 6, can string w ends in state number k? based on that, make of these states accepting language want?
hope helps!
Comments
Post a Comment