50 likes | 164 Views
This document presents detailed solutions to various problems from Homework 1, focusing on finite state automata. Included are solutions for problems regarding language acceptance patterns, specifically: Problem 3.6 which involves languages that accept either one "a" or more "b"s followed by a "c", and Problem 2.2 that outlines regular expressions involving consonants and vowels. Specific emphasis is placed on constructing DFA for the respective languages, with notes on epsilon transitions and state counts. This comprehensive analysis aids in understanding automata concepts.
E N D
Homework 1 Solution – Problem 1 1a: Accepts either one “a” or zero or more “b”s followed by a c. 1b: Accepts either one or more “ab” followed by a c or one “b” followed by zero or more a’s 1c: No Answer Provided …
Homework 1 Solution – Problem 2 2a: (1|00)* 2b: cons = {b, c, d, e, f ,,, y, z} vow = {a, e, i, o, u} ANS = cons* (vow | epsilon) cons*
Homework 1 Solution: 3.16a and 3.17a b 1, 2, 4, 5, 6, 7 0, 1, 2, 4, 7 b b a 3 2 a a 1, 2, 3, 4, 6, 7, 0 1 6 7 b a 4 5
Homework 1 Solution: 3.16d and 3.17d a 13 12 10 11 16 17 b 14 15 b 9 b 8 a a 3 2 0 1 6 7 Try Yourself: DFA for 3.17d Should have a total of 7 states b 4 5