Quiz3Soln

Quiz3Soln - Union, concatenation, and Kleene star (3...

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

View Full Document Right Arrow Icon
CSCI 2670 Intro. to Theory of Comp. Quiz 3 9/7/05 Name: ___Solution _____________ (1) (4 points) Draw a five-state NFA that accepts all strings of 0’s and 1’s with the substring 0011. (2) (3 points) What are the regular operators (i.e., the operators that are used to combine regular expressions in the definition of a regular expression).
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: Union, concatenation, and Kleene star (3 points) What language is accepted by the following NFA? The alphabet for this NFA is {a,b} You may describe the language informally or using a regular expression. All strings ending in either a, ab, or abb. a b b a,b...
View Full Document

Page1 / 2

Quiz3Soln - Union, concatenation, and Kleene star (3...

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