CS 3512 Spring Semester, 2010

20 Points

**
Reading: Distinguishability Notes
**

**
The assignment:
**

- (2 points) Devise a DFA that recognizes the empty language φ
- (3 points) Devise a DFA that recognizes the language {Λ}
- (3 points) Devise a DFA that recognizes the "singleton" language {a} over the alphabet Σ = {a,b}.
- (6 points) Use the Distinguishabiliy Corollary to prove that
the language L = { ww | w is in {0,1}
^{*}} is not regular. - (6 points) Use the Distinguishabiliy Corollary to prove that
the language L = { 0
^{n2}| n is in N } is not regular.