[Solved]Given Alphabet 0 1 2 3 4 5 6 7 8 9 Define Following Two Languages L1 X 5 X L2 L1 Elements Q37109710

Given the alphabet ∑={0,1,2,3,4,5,6,7,8,9}, define the followingtwo languages over ∑*: L1 = {xℕ, 5|x} and L2= ℕ- L1 Elements of L1 and L2 are represented in base ten withoutleading 0s, except for zero which is simply the single digit 0.

a) Write a regular expression denoting L1.

b) Write a regular expression denoting L2.

a) Draw a state diagram (= deterministic finite state automaton)with as few states as possible which recognizes L1. This statediagram should be complete: it should handle all strings ofdigits.

b) Draw a state diagram (= deterministic finite state automaton)with as few states as possible which recognizes L2. This statediagram should be complete: it should handle all strings ofdigits

Expert Answer

---

Answer to Given the alphabet ∑={0,1,2,3,4,5,6,7,8,9}, define the following two languages over ∑*: L1 = {xℕ, 5|x} and L2 = �… . . .