submit a .regex file with a regular expression defining the given language.

you can test it using the given link (remember to select the regex button, and erase the code in the screen before starting)

this is NOT for a dfa.

Use the regular expression evaluator to test each regex: http://web.cs.ucdavis.edu/-doty automata/regex.html. Do not test them using the regular expression library of a programming language; typically these are more powerful and have many more features that are not available in the mathematical definition of regular expressions from the textbook. Only the special symbols CI are allowed, as well as "input alphabet" symbols: alphanumeric, and . and 0. repeat near end: { x e {0,1)" | -4] =x[al-2] } Assume we start indexing at 1, so that ll) is the last symbol in