New Beginnings Theory Summer 2018
Aug 27
Prove that the following languages are regular by constructing a DFA that recognizes them.
- L1 = {s∣s is a binary representation of a multiple of 5}, Σ={0,1}
- L2 = {s∣s contains an odd number of 1s and an odd number of 0s}, Σ={0,1}
- L3 = {s∣s contains three conscutive 1s}, Σ={0,1}
- L4 = {s∣s's tenth symbol from the left end is a 1}, Σ={0,1}
- L5 = {s∣s is an even number represented in base 3}, Σ={0,1,2}
- L6 = {s∣s contains an even number of 0s or exactly three 1s}, Σ={0,1}