Here is a transition table for a DFA$:$ Give all the regular expressions $R_{ij}^{0}.$ Note$:$Think of state $q_{i}$ as if it were the state with integer number $i.$ Give all the regular expressions $R_{ij}^{1}.$ Try to simplify the ... for the language of the automaton. Construct the transition diagram for the DFA and give a regular expression for its language by eliminating state $q_{2}.$

Here is a transition table for a DFA$:$ Give all the regular expressions $R_{ij}^{0}.$ Note$:$Think of state $q_{i}$ as if it were the state with integer number $i.$ Give all the regular expressions $R_{ij}^{1}.$ Try to simplify the ... for the language of the automaton. Construct the transition diagram for the DFA and give a regular expression for its language by eliminating state $q_{2}.$

Prove or disprove each of the following statements about regular expressions. $(R+S)^{*}=R^{*}+S^{*}$ $(RS+R)^{*}R=R(SR+R)^{*}$ $(RS+R)^{*}RS=(RR^{*}S)^{*}$ $(R+S)^{*}S=(R^{*}S)^{*}$ $S(RS+S)^{*}R=RR^{*}S(RR^{*}S)^{*}$

Give a regular expression to represent salaries as they might appear in employment advertising. Consider that salaries might be given on a per hour, week, month or year basis. They may or may not appear with a dollar sign or other unit such as $"K"$ following. There ... . Suggestion$:$ look at classified ads in a newspaper, or on-line jobs listings to get an idea of what patterns might be useful.