Some Remarks on Lower Bounds for Queue Machines (Preliminary Report)
Computational Complexity
2018-03-13 v5 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.1310.6398,
title = {Some Remarks on Lower Bounds for Queue Machines (Preliminary Report)},
author = {Holger Petersen},
journal= {arXiv preprint arXiv:1310.6398},
year = {2018}
}