Any language that can be accepted by a DFA is called a regular language. Show that if L is a regular language then L {} is regular as well. You can do this by describing how you would modify a DFA which accepts L so that you get another DFA which accepts L {}.