52 views

For each of the following languages, give two strings that are members and two strings that are not members—a total of four strings for each part. Assume the alphabet $Σ = \{a,b\}$ in all parts.

1. $a^{*}b^{*}$
2. $a(ba)^{*}b$
3. $a^{*}\cup b^{*}$
4. $(aaa)^{*}$
5. $\sum^{*}a\sum^{*}b\sum^{*}a\sum^{*}$
6. $aba\cup bab$
7. $(\epsilon\cup a)b$
8. $(a\cup ba\cup bb)\sum^{*}$
| 52 views