Theory Computation Design Deterministic Turing Machine Accepts Regular Language 10 01 E Se Q37130605

theory of computation

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

1. If we string starts with 0, then we check if all remaining are1’s. If blank sysmbol is found then we goto FINAL state.
2. and do the reverse for string that starts with 1.

Table Text Siee Accept Accept Reject Reject Accept Accept Accept Accept Reject Reject

OR

 

OR