Lecture Notes in Computer Science

TitleStudy of limits of solvability in tag systems
Publication TypeConference Paper
Year of Publication2007
AuthorsDe Mol, L
EditorJ Lose, D, Margenstern, M
Conference NameLecture Notes in Computer Science
PublisherSpringer
ISBN Number978-3-540-74592-1
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.

Citation Key384497
Download PDF (Author PDF)
PDF author (public):