| Type | Decision Turing Machine |
|---|---|
| States | q0, q1, q2, q3, q4, q5 |
| Problem alphabet | '0', '1' |
| Tape alphabet | '_', '#', '0', '1' |
| Initial State | q0 |
| Accept State | q1 |
| Reject State | q2 |
| Number of transitions | 16 |
| Deterministic | No |
| Current State | Read Symbol | ⟶ | Next State | Write Symbol | Direction |
|---|---|---|---|---|---|
| q0 | '_' | ⟶ | q1 | '_' | R |
| q0 | '0' | ⟶ | q3 | '_' | R |
| q0 | '1' | ⟶ | q2 | '_' | R |
| q3 | '_' | ⟶ | q4 | '_' | L |
| q3 | '0' | ⟶ | q3 | '0' | R |
| q3 | '1' | ⟶ | q3 | '1' | R |
| q4 | '_' | ⟶ | q2 | '_' | R |
| q4 | '0' | ⟶ | q2 | '0' | R |
| q4 | '1' | ⟶ | q5 | '_' | L |
| q5 | '_' | ⟶ | q0 | '_' | R |
| q5 | '0' | ⟶ | q5 | '0' | L |
| q5 | '1' | ⟶ | q5 | '1' | L |
Test Cases
| Input | Output | Status |
|---|