Computer Science > QUESTIONS & ANSWERS > COSC 5315 Foundations of Computer Science Lamar University - COSC 5315Assignment 3 (All)

COSC 5315 Foundations of Computer Science Lamar University - COSC 5315Assignment 3

Document Content and Description Below

COSC 5315 Foundations of Computer Science Assignment 3 Exercise 1 (Ex. 1, Chapter 3 of [Martin; 2011]). Exercise 2 (Ex. 3, Chapter 3 of [Martin; 2011]). Exercise 3. (Ex. 7, Chapter 3 of [Martin; 2 ... 011]). Find a regular expression corresponding to each of the following subsets of {a, b}*: a. The language of all strings containing exactly two a’s. b. The language of all strings containing at least two a’s. c. The language of all strings that do not end with ab. d. The language of all strings that begin or end with aa or bb. e. The language of all strings not containing the substring aa. f. The language of all strings in which the number of a’s is even. g. The language of all strings containing no more than one occurrence of the string aa. (The string aaa should be viewed as containing two occurrences of aa.) h. The language of all strings in which every a is followed immediately by bb. i. The language of all strings containing both bb and aba as substrings. j. The language of all strings not containing the substring aaa. Exercise 4 (Ex. 18 and 19, Chapter 3 of [Martin; 2011]). Here is a transition diagram for an NFA [Show More]

Last updated: 8 months ago

Preview 2 out of 4 pages

Buy Now

Instant download

We Accept: