1-4 CHARACTERS CODE(if you want your final grade posted)

 
CIS 625: Final Exam
 
1:50 minutes
Open Notes, Open Books
The exam consists of problems
Answers not appearing in designated spaces WILL NOT be graded

• Problem #1 (10 points) For each of the following cases, determine the language accepted by the Turing machine. (a)

  (b)

• Problem #2 (10 points) Provide a deterministic recursive decent program for the language accepted by the following pushdown automaton.

  

• Problem #3 (10 points) Let G be the grammar whose production rules are listed below. Give a finite state automaton accepting the following language.

  L = {| is over {a, b}, and a prefix of is in L(G)}

  S	aA
  	bB
  	a
  A	aA
  	bB
  	a
  B	aS
  	b

• Problem #4 (10 points) Use the pumping lemma to show that the following language is not context free.
  

[course grades]