Advanced search
1 file | 296.46 KB Add to list

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

Liesbeth De Mol (UGent)
(2010) Fundamenta Informaticae. 99(4). p.435-471
Author
Organization
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
halting problem, nu-Tag systems, reachability problem, non-universality, TAG SYSTEMS

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 296.46 KB

Citation

Please use this url to cite or link to this publication:

MLA
De Mol, Liesbeth. “Solvability of the Halting and Reachability Problem for Binary 2-Tag Systems.” Fundamenta Informaticae, vol. 99, no. 4, 2010, pp. 435–71, doi:10.3233/FI-2010-257.
APA
De Mol, L. (2010). Solvability of the halting and reachability problem for binary 2-tag systems. Fundamenta Informaticae, 99(4), 435–471. https://doi.org/10.3233/FI-2010-257
Chicago author-date
De Mol, Liesbeth. 2010. “Solvability of the Halting and Reachability Problem for Binary 2-Tag Systems.” Fundamenta Informaticae 99 (4): 435–71. https://doi.org/10.3233/FI-2010-257.
Chicago author-date (all authors)
De Mol, Liesbeth. 2010. “Solvability of the Halting and Reachability Problem for Binary 2-Tag Systems.” Fundamenta Informaticae 99 (4): 435–471. doi:10.3233/FI-2010-257.
Vancouver
1.
De Mol L. Solvability of the halting and reachability problem for binary 2-tag systems. Fundamenta Informaticae. 2010;99(4):435–71.
IEEE
[1]
L. De Mol, “Solvability of the halting and reachability problem for binary 2-tag systems,” Fundamenta Informaticae, vol. 99, no. 4, pp. 435–471, 2010.
@article{1041652,
  abstract     = {{In this paper a detailed proof will be given of the solvability of the halting and reachability problem for binary 2-tag systems.}},
  author       = {{De Mol, Liesbeth}},
  issn         = {{0169-2968}},
  journal      = {{Fundamenta Informaticae}},
  keywords     = {{halting problem,nu-Tag systems,reachability problem,non-universality,TAG SYSTEMS}},
  language     = {{eng}},
  number       = {{4}},
  pages        = {{435--471}},
  title        = {{Solvability of the halting and reachability problem for binary 2-tag systems}},
  url          = {{http://dx.doi.org/10.3233/FI-2010-257}},
  volume       = {{99}},
  year         = {{2010}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: