# 313F03M - CPSC 313 Midterm Test Name Lecture Section Lab...

This preview shows pages 1–5. Sign up to view the full content.

CPSC 313 — Midterm Test October 16, 2003 Name: Lecture Section: Lab Section: Please DO NOT write your ID number on this page. Instructions: Answer all questions in the space provided. No Aids Allowed. This test is out of 50. Duration: 90 minutes

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
ID Number: 1. (9 marks) Design a DFA that processes strings over the alphabet Σ = { a, b, c } and that recognizes the following language. L = { w Σ * | w includes exactly one a and an odd number of b ’s } . Give a short explanation, or sketch a short proof, showing that your DFA is correct. Your DFA: Explanation or Proof: 1
ID Number: 2. (9 marks) The following NFA processes strings over the alphabet Σ = { a, b, c } . Con- struct a DFA that is equivalent to this NFA and give a brief justi±cation of your answer. Start q 0 q 1 q 2 q 3 a, b, c a b a a, c Your DFA: Explanation or Proof: 2

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
ID Number: 3. Consider the following regular expression, e 1 over the alphabet Σ = { a , b } : ( ab * a ) * ab * In this question, you are asked to prove a number of results about the language of
This is the end of the preview. Sign up to access the rest of the document.
• Spring '08
• NA
• Formal language, Formal languages, Regular expression, Regular language, Nondeterministic finite state machine, ID NUMBER

{[ snackBarMessage ]}

### Page1 / 9

313F03M - CPSC 313 Midterm Test Name Lecture Section Lab...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online