MATH2907 Session 1, 2020

If you have the Wolfram Player installed but the plug-in does not work, then download the CDF file for viewing locally.

Parenthesis Language

The following extended Turing machine using 4 characters, checks strings of parentheses for correct matching.

Parenthesis language Turing machine

In the implementation below, '(' = white, ')' = black, which are entered as 0 and 1 respectively.
These are enclosed in '#' = red, entered as 9, and are converted to '*' = green, when balanced.
Instructions shown as '?' indicate that further processing could be done, or the head re-positioned, especially with unbalanced parenthesis strings.


To get the best from this interactive module, you will need to download the free CDF player from the Wolfram Inc. website.