Home automata dfa nfd [ Automata] Find the DFA for the language

[ Automata] Find the DFA for the language

22:43

Read

Find the DFA for the language
$L = {a n b : n \geq 0} \cup {b n a : n \geq 1}$

This is a problem from the book "An Introduction to Formal Languages amd Automata 4th edition", exercise 2 b) page 68.

Since there are very few examples in the textbook, I found it very difficult to test my work, especially self-taught. This is my attempt, does it look reasonable?

No comments:

Subscribe to: Post Comments ( Atom )