Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

DOI10.3233/FI-2010-257MaRDI QIDQ4932076zbMATH OpenFDO

Authors Liesbeth De Mol

Publication date 1 October 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

reachability problemhalting problemnon-universality2-tag systems

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Thue and Post systems, etc. (03D03)

Cited in

(2)

• On the complex behavior of simple tag systems -- an experimental approach
• Tag systems and Collatz-like functions

This page was built for publication: Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932076)