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

Liesbeth de Mol

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

Liesbeth de Mol ¹

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

Domain :

Computer Science [cs] / Formal Languages and Automata Theory [cs.FL]

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

Corr4.pdf

Files produced by the author(s)

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

File

Identifiers

Collections

Citation

Export

Metrics

98

195

Contact

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

File

Identifiers

Collections

Citation

Export

Share

Metrics

98

195

Contact