in Theory of Computation retagged by
208 views
0 votes
0 votes
Can anyone help me in this exercise:
Show that the language L = {an : n is a multiple of three, but not a multiple of 5} is regular with DFA.

i make DFA but i don’t sure if it T or NOT

was there 15 states.
in Theory of Computation retagged by
by
208 views

Please log in or register to answer this question.

Related questions