Find the DFA for the languageL={anb:n≥0}∪{bna:n≥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?
.jpg)
No comments:
Post a Comment