Question

Construct a nondeterministic finite automaton accepting {ab, ba}. and use it to find a deterministie automaton accepting the same set.​

Answer 1

Answer:

L1 = ab, abba, abaa,.... as we can see that each string of the abovementioned language has 'ab' as... Construction of a minimal NFA accepting a collection of…

Explanation:

Yes, the symbol a*b* signifies a regular language. Any number of an accompanied by any degree of b, with any number meaning zero (including null) or more times in each. Here are some examples of strings:, a, b, aab, abbb, aabbb,...A fully regular language is a*b*c*. In fact, appearance is a regular expression in the usual sense proof in and of itself that the phrase is regular.Any repetition of letters a, up to and be followed by any repetition of symbol b.

To know more about repetition , visit:

https://brainly.in/question/54166347

To know more about appearing , visit:

https://brainly.in/question/46478038

#SPJ3