Page 1 of 3

IZMIR UNIVERSITY of ECONOMICS CE 308 Midterm 2B , Fall 2017

Student ID: ________________Full Name: _____________________Signature:_____________Section:___

Instructions: Write your answers clearly in the space provided, or in the back of the sheets.

1. (5pts) What is the regular expression for all binary strings that start with 10 and end with 001?

2. (5pts) Order the following automata, grammar, and language types by expressive power in ascending
order. Indicate when equal as in e < b = c = d < a < f = g
a. CFL b. PDA c. Regular Expression d. Multitape TM e. NFA, f. deterministic TM g. non-
deterministic TM

3. (10pts) List all possible paths (state sequences) on input 10101 for the NFA below; mark each path
as accepting, rejecting, or dead-end.

0,1

 0 1
q’0 q0 q1 q2
 Page 2 of 3

4. (10pts) Trace all possible paths for the turing machine below on input #aaab, Mark each path as
accepting, deadend, or rejecting. Use the instant descriptor notation e.g., (q0#aaab) for starting
configuration.

q1 q2 q3

5. (30pts) Prove or disprove that any language described by a context free grammar is also
accepted by a pushdown automata
 Page 3 of 3

6. (30pts) Design a PDA that recognize {02n13n |n>=0}

7. (30pts) Prove or disprove that there exists a Turing machine that can accept the language
{M| M is a Turing machine that halts on all inputs}