Freezing 1-Tag Systems with States
arXiv:2309.02753 · doi:10.4204/EPTCS.386.8
Abstract
We study 1-tag systems with states obeying the freezing property that only allows constant bounded number of rewrites of symbols. We look at examples of languages accepted by such systems, the accepting power of the model, as well as certain closure properties and decision problems. Finally we discuss a restriction of the system where the working alphabet must match the input alphabet.
In Proceedings AFL 2023, arXiv:2309.01126