Read Sipser § 1.3
- What does 11* represent?
- Explain, in your own words, expression #8 in Example 1.53
- There are often multiple NFAs or DFAs to express the same language. Define an NFA that represents example 1.56 with only two states. That is, N = (Q, S, d, q0, F), where Q = {q0, q1}, and S = {a,b}. You fill in the values for d (delta) and F.
- Give a regular expression for a language L of strings drawn from the alphabet S = {0,1,-,.} that obey the following properties:
- All strings in L are strings of binary digits
- Each string may optionally be preceded by a single (-)
- Each string may optionally contain a single (.). At least one binary digit must follow the (.) if it appears in the string.
