03-60-214: Lab 3
03-60-214: Lab 3. Jan 30, Winter 2004. Exercises. Draw the diagrams of an FA (DFA or NFA) for the following languages, the alphabet is {a, b, ..., z}. Write the regular expression after you have the diagram. A string containing an 'a'; A string containing two consecutive 'a's.
169 views • 8 slides