IT, operating systems, maths, and more.
This is the fifth part of the Turing Machine series. For your convenience you can find other parts in the table of contents in Part 1 – Addition Today we check whether a string has exactly twice as many ones as zeroes. States: The input looks like this: Transition table:
This is the fourth part of the Turing Machine series. For your convenience you can find other parts in the table of contents in Part 1 – Addition Today we subtract two numbers. This is very similar to addition so should be pretty readable. States: The input looks like this: Transition table:
This is the third part of the Turing Machine series. For your convenience you can find other parts in the table of contents in Part 1 – Addition Today we check if given word w is a palindrome. First, we add delimiters at the beginning and at the end. Next, we check first character from … Continue reading Turing Machine Part 3 — Checking palindromes
This is the second part of the Turing Machine series. For your convenience you can find other parts in the table of contents in Part 1 – Addition Today we check if given word w is of a form w = xx. Idea is: first I add delimiters ^ to the word boundary. Next, I … Continue reading Turing Machine Part 2 — Checking if a word is a repetition
This is the first part of the Turing Machine series. For your convenience you can find other parts using the links below: Part 1 — Addition Part 2 — Checking if a word is a repetition Part 3 – Checking palindromes Part 4 — Subtraction Part 5 — Twice as many ones as zeroes In … Continue reading Turing Machine Part 1 — Addition