L=all the strings consisting of some number (possibly none) of a followed by some number (possibly none) of b={ϵ,a,b,aa,bb,ab,aaa,aab,bbb,abb,abb,...,aaaabbbbbbb}
We can use the regular expression:
a∗b∗⇝L is represented by the regular expression a∗b∗
We use the notation: L=Language_of(a∗b∗)
Which we read as “the language of a∗b∗ is L”,
or “the language represented by a∗b∗ is L”.
Example 3
Langauge_of(a(a∗∪b∗))=all words starting with a followed by either a(possibly empty) word of a or a (possibly empty)word of b={a,aa,ab,aaa,abb,aaaa,abbb,aaaaaa,abbbbbbb}
Example 4
Language_of(a(a∪b∗))=all words starting with a followed byany word over {a,b}=all words over {a,b} starting with a={a,aa,ab,aaa,aab,aba,abb,aaaaa}
Example 5
Find the Language_of((b∪aaa∗)∗).
Start by finding Language_of(aaa∗)
Language_of(aaa∗)=all words of a of length ≥2={aa,aaa,aaaa,aaaaa,...}
Find Language_of(b∪aaa∗)
Language_of(b∪aaa∗)= as above plus the word b={b,aa,aaa,aaaa,...}
Find Language_of((b∪aaa∗)∗)
We can take any number (possibly none) of words from Language_of(b∪aaa∗) and concatenate them together.
Example 6
Find the Language_of((b∪a)aa∗).
Find Language_of(b∨a)={a,b}.
Find Language_of((b∨a)a)={aa,ba}.
Find Language_of((b∨a)aa∗)= all words starting with aa or ba followed by a (possibly empty) word of as.
Example 7
Find the Language_of(ϵ∨c∗(a∨bc∗))
All the strings that are either empty or start with some (possibly none) cs followed by either an a, or a b followed by (possibly none) cs.