# Homework 3 - Î(e P={S â†’ aA S â†’ bB A â†’ aB B â†’ bA A...

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

Homework Three CS 291 : Discrete Structures II Winter 2004, VOB, ref. no. 14136 Due date: April 27, 2004, Tuesday, in class There are 13 problems with 10 points each. Supplemental Material (Chapter 8 Network Models) Section 8.1 1. Page 395, Exercise 9. Section 8.2 2. Page 403, Exercise 11. Section 8.3 3. Page 406, Exercise 3. Section 8.4 4. Page 411, Exercise 3. Chapter 11 Section 11.1 5. Page 749, Exercise 12(b) 6. For each of the following grammars, G = {N, T, S, P}, identify which type(s) the grammar belongs to. (a) P= {S aA, S bAB, AB AabS, A a, B b, S λ } (b) P= {S abAB, S AB, bAB Ab, SA a, B b, A λ } (c) P= {S aA, S bA, A aA, A aB, B b, S λ } (d) P= {S A, S B, A aAb, A aB, B bBa, B

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Î» } (e) P= {S â†’ aA, S â†’ bB, A â†’ aB, B â†’ bA, A â†’ b, S â†’ Î» } 7. Write a type 3 grammar that generates all strings over {a, b} starting with ab. Section 11.3 8. Determine whether the string 10011 is in each of the following sets. 1 (a) {0,1}* (b) {1}*{0}*{1}* (c) {11}*{0}{01}* (d) {0}*{10}*{11}* (e) {{10, 100}{ Î» , 01, 1}{11} 9. Page 764, Exercise 10(a)(c) 10. Page 764, Exercise 12. 11. Page 764, Exercise 22. Section 11.4 12. Page 774, Exercise 8(b) 13. Design a finite state automaton that recognizes the strings over {0, 1} that contains an even number of 0s and a multiple of three of 1s. For example, 0101001 is an accepted string because there are four 0s and 3 1s. 2...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

Homework 3 - Î(e P={S â†’ aA S â†’ bB A â†’ aB B â†’ bA A...

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

View Full Document
Ask a homework question - tutors are online