Name: ____________________________________________________ Alpha: _____________________
Describe help received: _________________________________________________________________
Input: Grammar G = (Σ,NT,R,S) Output: String u' such that u' ∈ L but u' ∉ L(G) or u' ∉ L but u' ∈ L(G)

Proof of correctness for algorithm: (note: 0 and 1 are not prime!) 
S → SS  SSS  00  01  11  000  001  010  011  100  101  110  111