Problem
i. Construct deterministic automata accepting this language: L(M) = { ω ? {a, b}*: each a in ω is immediately preceded by a b }.
ii. Construct non-deterministic automata accepting this language: L(M) = { ω ? {a, b}*: each a in ω is immediately preceded by a b }.
iii. Construct deterministic automata accepting this language: L(M) = { ω ? {a, b}*: ω has abab as a substring }.
iv. Construct non-deterministic automata accepting this language: L(M) = { ω ? {a, b}*: ω has abab as a substring }.