Design Deterministic Turing Machine Accepts Regular Language 10 01 E Set Strings First Sym Q37074241

Design a deterministic Turing machine that accepts the regularlanguage 10* + 01*, i.e., the set of strings in which the firstsymbol does not appear again on the input. The alphabet is{0,1}

Solution