0 votes 0 votes Find linear bounded automata for the following language. $L = \{a^n: \text{n is not a prime number}\}$. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine proof + – Rishi yadav asked Apr 3, 2019 edited Apr 3, 2019 by Rishi yadav Rishi yadav 249 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.