I’m stuck on a Computer Science question and need an explanation.
Consider the following generalized transition graph
- Find an equivalent generalized transition graph with only two states.
- What is the language accepted by this graph?
Find regular expressions for the languages accepted by the following automata
For , find regular expressions for the complement of the language .
Show the language is not regular.