CS381-2004fa-prelim2 - CS381 Fall 2004 Hollister B14 Second...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS381 Second Mid Term Fall 2004 Friday Nov 5, 2004 Hollister B14 9:05-9:55 This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Credit will be based on both correctness and clarity of answers. 1. Is every regular set a context-free language?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
  • Fall '07
  • Formal language, Regular expression, Pushdown automaton, Context-free grammar, nondeterministic pushdown automata, context-free

{[ snackBarMessage ]}

Ask a homework question - tutors are online