0 votes 0 votes Show that the language $L =$ {$a^n: n$ is a multiple of $3$, but not a multiple of $5$} is regular. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata regular-language + – Naveen Kumar 3 asked Mar 20, 2019 Naveen Kumar 3 331 views answer comment Share Follow See 1 comment See all 1 1 comment reply KUSHAGRA गुप्ता commented Oct 2, 2019 reply Follow Share 0-14 (15 states) final states-3,6,9,12 Non final- 0,1,2,4,5,7,8,10,11,13,14 0 votes 0 votes Please log in or register to add a comment.