0 votes 0 votes Design a nondeterministic Turing machine that accepts the language. $L = \{a^n: \text{n is not a prime number}\}$. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine + – Rishi yadav asked Apr 2, 2019 Rishi yadav 285 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.