edited by
249 views
0 votes
0 votes
Find linear bounded automata for the following language.

                                                             $L = \{a^n: \text{n is not a prime number}\}$.
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4