Problem
1) Write regular expression that accepts the language of all binary strings not ending in 10.
2) Design an automaton with with at most 3 states that accepts the language of all binary strings not ending in 10.
3) Write regular expression that accepts the language of all binary strings with no occurrence of 110.
4) Design an automaton with at most 4 states that accepts the language of all binary strings with no occurrence of 110.