Freezing 1-Tag Systems with States
Szil\'ard Zsolt Fazekas (Akita University), Shinnosuke Seki, (University of Electro-Communications)
TL;DR
This paper investigates 1-tag systems with states that have a freezing property limiting rewrites, exploring their language acceptance capabilities, closure properties, decision problems, and a restricted variant where the alphabet matches the input.
Contribution
It introduces the freezing property in 1-tag systems with states and analyzes their computational power and structural properties.
Findings
Identified languages accepted by freezing 1-tag systems
Analyzed closure properties and decision problems
Discussed a restricted system with matching input and working alphabets
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.