Homework Statement
I am self studying automata theory and I found a problem set from an old class I took a few years ago, but I have no clue how to solve the following problem, any help would be appreciated.Suppose we have a regular language ##L \subseteq \{0,1\}^*## and the language ##...