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) Give the transition diagram of a deterministic pushdown automaton that accepts the language generated by the following grammar.

  S	aABb
  	bBAa
  A	aB
  	b
  B	bS
  	a

• Problem #3 (10 points) Find a type 3 grammar for the complement of the language that the following grammar generates.

  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 regular.