Chrome Extension
WeChat Mini Program
Use on ChatGLM
VIPCreated with Sketch.

Freezing 1-Tag Systems with States

Szilárd Zsolt Fazekas,Shinnosuke Seki

CoRR（2023）

Cited 0|Views3
No score
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.
More
Translated text
Key words
freezing,states,systems
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined