220 views
0 votes
0 votes

L= {an | n is a perfect square }. This language can be implemented using:


A. Push Down automata

B. linear Bounded Automata

C. Turing machine

D. both C and D

Please log in or register to answer this question.