Draw a DFSA that accepts the following language: L5 = anbn where0 < n < 4. Explicitly state the alphabet used in thislanguage, 5. Full credit will be awarded only to a minimal machine(meaning a machine that uses the fewest possible states. Also donot include any fail states.)
Solution
b t So alph now au. as 어여 e–o se:@s@s@se deod
OR
OR