and from this that L 1 /L 2 is regular.
Example 4.5
Find L 1 /L 2 for
We first find a dfa that accepts L 1 . This is easy, and a solution is given in Figure
4.3. The example is simple enough so that we can skip the formalities of the
construction. From the graph in Figure 4.3 it is quite evident that
Therefore, the automaton accepting L 1 /L 2 is determined. The result is shown in
Figure 4.4. It accepts the language denoted by the regular expression of a*b +
a*baa*, which can be simplified to a*ba*. Thus L 1 /L 2 = L(a*ba*).
Figure 4.3
Figure 4.4