RAIRO-Theor. Inf. Appl.
Volume 33, Number 3, May June 1999
|Page(s)||303 - 307|
|Published online||15 August 2002|
Lower Space Bounds for Accepting Shuffle Languages
Institute of Mathematics,
University of Gdańsk,
ul Wita Stwosza 57, 80952 Gdańsk, Poland
Accepted: 18 July 1999
In  it was shown that shuffle languages are contained in one-way-NSPACE(log n) and in P. In this paper we show that nondeterministic one-way logarithmic space is in some sense the lower bound for accepting shuffle languages. Namely, we show that there exists a shuffle language which is not accepted by any deterministic one-way Turing machine with space bounded by a sublinear function, and that there exists a shuffle language which is not accepted with less than logarithmic space even if we allow two-way nondeterministic Turing machines.
Mathematics Subject Classification: 68Q15 / 68Q45
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.