Some Remarks on Lower Bounds for Queue Machines (Preliminary Report)
classification
💻 cs.CC
cs.FL
keywords
argumentlowermachinesproofsqueuesomeareabehind
read the original abstract
We first give an improved lower bound for the deterministic online simulation of tapes or pushdown stores by queues. Then we inspect some proofs in a classical work on queue machines in the area of Formal Languages and outline why a main argument in the proofs is incomplete. Based on descriptional complexity, we show the intuition behind the argument to be correct.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete
Sliding-window transformers without positional encodings are Turing complete because the sliding window breaks permutation symmetry and suffices to simulate Post machines via a constant-size histogram state.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.