t1 - pressions. 3. What does it mean for an innite set to...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
University of Central Florida School of Computer Science COT 4210 Spring 2004 Prof. Rene Peralta T1 1. Consider integers written in base 3 with no leading 0s. Let L 1 be the set of such strings which represent odd numbers. (a) Construct a DFA that accepts L 1 . (b) Construct a left-linear grammar for L 1 . 2. Consider the language L 2 generated by the following grammar S AB + C A aB + C B Ab + C C b + aaaC Characterize L 1 using a combination of set notation and regular ex-
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: pressions. 3. What does it mean for an innite set to be countable? 1 4. Construct a DFA equivalent to the following NFA. 5. Consider the language over = { a,b,c } consisting of strings with more occurrences of the pattern abc than occurrences of the pattern abb. Is this a regular language? Justify your answer. 2...
View Full Document

This note was uploaded on 06/09/2011 for the course COT 4210 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 2

t1 - pressions. 3. What does it mean for an innite set to...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online