draw a DFA, NOT AN NFA that accepts exactly the strings over the alphabet {0,1} that contain the substring 00101

Write a Python program to take a string from user and remove all the duplicate characters from it where the order does not required to be same.

Write a regular expression for each question that describing the set of strings over the alphabet Σ = {0, 1} that: a. Does not contain the string 110. b. Start and end with the same letter.

Write down the NFA-epsilon to recognize all the strings with the following specification over the alphabet { 1, 2, 3, a, b, c }:   An acceptable string start with a header part including either 1, 2, or 3 with a following a, b, or c.   If, exactly, that number of symbols exists in the rest of the string, then the string is accepted. Otherwise, it is rejected. For instance, 2bac2c3acbdcba1ad is an acceptable string, since it starts with a header part 2b, and we have exactly two b symbols in the rest of the string. Header                  Rest   2b              ac2c3acbdcba1aa