1. Show that the following Language is not Regular using Pumping Lemma Theorem.

L= { an | n is a perfect square} .

L= { an | n is a perfect square} .

## This question was asked on May 26, 2010.

### Recently Asked Questions

- Hi! Kindly help me with my Strategic Management Case Study. The title of the case is " Citibank in Zaire". You can read the case here at page 483

- Your company has spent $270,000 on research to develop a new computer game. The firm is planning to spend $47,000 on a machine to produce the new game.

- Please refer to the attachment to answer this question. This question was created from Balance Sheet. Additional comments: "Can you explain how the company