Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

In this paper we will provide a detailed proof of the solvability of the halting and reachability problem for binary 2-tag systems. We will furthermore prove that an important subclass of this class has a solvable modified reachability problem.

• Type: Journal
• Year: 2010
• Where: FUIN
• Authors: Liesbeth De Mol
• Keywords: Binary 2-tag Systems, FUIN 2010, Reachability Problem, Solvable Modified Reachability