Computer Science > QUESTIONS & ANSWERS > COSC 5315 Foundations of Computer Science Lamar University - COSC 5315Assignment 3 (All)
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: 2 months ago
Preview 2 out of 4 pages
Loading document previews ...
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Can't find what you want? Try our AI powered Search
Connected school, study & course
About the document
Uploaded On
Mar 31, 2021
Number of pages
4
Written in
This document has been written for:
Uploaded
Mar 31, 2021
Downloads
0
Views
65
In Scholarfriends, a student can earn by offering help to other student. Students can help other students with materials by upploading their notes and earn money.
We're available through e-mail, Twitter, Facebook, and live chat.
FAQ
Questions? Leave a message!
Copyright © Scholarfriends · High quality services·