Question

write regular expression for language that accept by automata​

Answer 1

Answer:

The language accepted by finite automata can be easily described by simple expressions called Regular Expressions. A regular expression can also be described as a sequence of pattern that defines a string. ... Regular expressions are used to match character combinations in strings.

Explanation:

hope it helps!!!!