Solvability of the halting and reachability problem for binary 2-tag systems

Liesbeth de Mol 1
1 STL - Savoirs, Textes, Langage (STL) - UMR 8163
Abstract : In this paper a detailed proof will be given of the solvability of the halting and reachability problem for binary 2-tag systems.
Keywords : non-universality v-Tag systems halting problem reachability problem
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
https://hal.univ-lille3.fr/hal-01396536
Contributor : Liesbeth de Mol <>
Submitted on : Monday, November 14, 2016 - 3:37:00 PM
Last modification on : Tuesday, July 3, 2018 - 11:30:02 AM
Long-term archiving on : Monday, March 20, 2017 - 7:53:17 PM

File

Corr4.pdf
Files produced by the author(s)

Identifiers

Collections

UNIV-LILLE3 | CNRS | STL | UNIV-LILLE

Citation

Liesbeth de Mol. Solvability of the halting and reachability problem for binary 2-tag systems. Fundamenta Informaticae XX, 2010, 99 (4), pp.435-471. ⟨10.3233/FI-2010-257⟩. ⟨hal-01396536⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

104

Files downloads

207

Contact

CCSD