Academic Bibliography

 Search 200 years of publications by Ghent University researchers.
Advanced search
Add to list
  1. Search results
  2. Study of limits of solvability in tag...

Study of limits of solvability in tag systems

Liesbeth De Mol (UGent)
(2007) LECTURE NOTES IN COMPUTER SCIENCE. 4664. p.170-181
Author
Organization
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. This result will be situated in a more general context of research on limits of solvability in tag systems.
Keywords
tag systems, reachability problem, limits of solvability, halting problem

Citation

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

MLA
De Mol, Liesbeth. “Study of Limits of Solvability in Tag Systems.” LECTURE NOTES IN COMPUTER SCIENCE, edited by J Durand Lose and M Margenstern, vol. 4664, Springer, 2007, pp. 170–81.
APA
De Mol, L. (2007). Study of limits of solvability in tag systems. In J. Durand Lose & M. Margenstern (Eds.), LECTURE NOTES IN COMPUTER SCIENCE (Vol. 4664, pp. 170–181). Berlin, Germany: Springer.
Chicago author-date
De Mol, Liesbeth. 2007. “Study of Limits of Solvability in Tag Systems.” In LECTURE NOTES IN COMPUTER SCIENCE, edited by J Durand Lose and M Margenstern, 4664:170–81. Berlin, Germany: Springer.
Chicago author-date (all authors)
De Mol, Liesbeth. 2007. “Study of Limits of Solvability in Tag Systems.” In LECTURE NOTES IN COMPUTER SCIENCE, ed by. J Durand Lose and M Margenstern, 4664:170–181. Berlin, Germany: Springer.
Vancouver
1.
De Mol L. Study of limits of solvability in tag systems. In: Durand Lose J, Margenstern M, editors. LECTURE NOTES IN COMPUTER SCIENCE. Berlin, Germany: Springer; 2007. p. 170–81.
IEEE
[1]
L. De Mol, “Study of limits of solvability in tag systems,” in LECTURE NOTES IN COMPUTER SCIENCE, Orléans, France, 2007, vol. 4664, pp. 170–181.
@inproceedings{384497,
  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. This result will be situated in a more general context of research on limits of solvability in tag systems.}},
  author       = {{De Mol, Liesbeth}},
  booktitle    = {{LECTURE NOTES IN COMPUTER SCIENCE}},
  editor       = {{Durand Lose, J and Margenstern, M}},
  isbn         = {{978-3-540-74592-1}},
  issn         = {{0302-9743}},
  keywords     = {{tag systems,reachability problem,limits of solvability,halting problem}},
  language     = {{eng}},
  location     = {{Orléans, France}},
  pages        = {{170--181}},
  publisher    = {{Springer}},
  title        = {{Study of limits of solvability in tag systems}},
  volume       = {{4664}},
  year         = {{2007}},
}
Web of Science
Times cited: