3 search results - page 1 / 1 » Solvability of the Halting and Reachability Problem for Bina... |
FUIN
2010
13 years 3 months ago
2010
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 sub...
MCU
2007
13 years 6 months ago
2007
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
CONCUR
2000
Springer
13 years 8 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...