IZMIR Un.

of ECONOMICS CE 308 Midterm 2, Fall 2018

Student ID: ________________Full Name:______________________Signature:____________

Instructions: Each question is worth 20 points. Write the answers in empty portion of the sheet.

1. Reorder the following from least to most expressive, indicate where equal e.g., b < c=d < a

a) empty stack PDA b) DFA c) deterministic TM d)multitape TM e) regular expression f) CFG

2. Build a PDA that accepts {0n13n| n>=2}

3. Convert the CFG (V, T, P, S) to Chomsky Normal Form. V={S, A, B, C, D}, T={0, 1}

P= {S-> ABBS | CCD D -> ABA | C C -> 0 | B-> 10}

Y / X,L
1 / 1,R
4. Trace the TM for one step, starting from the current 1 / X,R
q q1
descriptor of (B10q1Y00B)

X / X,R Y / Y,R
Y / Y,R

Y / Y,R B / B,R q2
q3 q4 Y / Y,L
5. Prove or disprove that the set of binary strings containing twice as many zeros as ones is regular.

6. (BONUS) Describe one automata theory concept not covered in class,that you learned on your own.
SOLUTIONS