O'Reilly logo

Discrete Structures, Logic, and Computability, 4th Edition by James L. Hein

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 11

Section 11.1

1. a. {a, b}.

c. {a, Λ, b, bb, . . ., bn, . . . }.

e. {a, b, ab, bc, abb, bcc, ..., abn, bcn, . . . }.

2. a. a + b + c. c. ab* + ba*. e. Λ + a(bb)*. g. Λ + c*a + bc*. i. a*bc*.

3. 0 + 1(0 + 1)*.

4. a. (aa + ab + ba + bb)*. c. (a + b)*aba(a + b)*.

5. a. (ab)*. c. a (a + b)*.

6. a.

b+ab*+aa*b+aa*ab*=b+ab*+aa*(b+ab*)=(Λ+aa*)(b+ab*)=a*(b+ab*)0000000000(by(11.1.1e)

c. By using property 7 of (11.1.1g) the subexpression (a + bb*a)* of the left side am be written (a*bb*a)*a*. So the left expression has the following form:

ab*a(a + bb*a)*b = ab*a(a*bb*a)*a*b.

Similarly, the subexpression (b + aa*b)* of the right side of the original equation can be written as b*(aa*bb*)*. So the right expression has the following form:

a(b + ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required