Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
Home
Publications
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
Author:
LM
Liesbeth De Mol
Liesbeth De Mol
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 May 2010
journal article
Published by
SAGE Publications
in
Fundamenta Informaticae
Vol. 99
(4)
,
435-471
DOI:
10.3233/fi-2010-257
Abstract
In this paper a detailed proofwill be given of the solvability of the halting and reachability problem for binary 2-tag systems.
Keywords
PROBLEM FOR BINARY
PROOFWILL
SOLVABILITY OF THE HALTING
HALTING AND REACHABILITY PROBLEM
Related articles
Cited
Cited by 3 articles
Scroll to top