Freezing 1-Tag Systems with States

DOI10.4204/eptcs.386.8arXiv2309.02753MaRDI QIDQ6204127

Szilárd Zsolt Fazekas, Shinnosuke Seki

Publication date: 9 April 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.02753

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A pumping lemma for deterministic context-free languages
• Context-free languages can be accepted with absolutely no space overhead
• Topological sorting of large networks
• The Power of the Queue
• Queue Automata: Foundations and Developments
• Universality of Tag Systems with P = 2
• One-Way Jumping Finite Automata
• A variant of a recursively unsolvable problem
• Descriptional complexity of iterated uniform finite-state transducers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Freezing 1-Tag Systems with States