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 sh!va asked Jan 3, 2017 sh!va 220 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply thor commented Jan 3, 2017 reply Follow Share D is right 1 votes 1 votes focus _GATE commented Jan 3, 2017 reply Follow Share LBA and turing machine both can do ryt ?? 1 votes 1 votes Please log in or register to add a comment.