Describe the language accepted by the deterministic nite automata shown in Figure 2.

Write down the table of transition function of deterministic

Figure 2: Problem 2 finite automata accepting the language {w{a,b} : each a in w is immediately preceded by one b}