Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T04:25:32.872Z Has data issue: false hasContentIssue false
  • English
  • Français

Lower Space Bounds for Accepting Shuffle Languages

Published online by Cambridge University Press:  15 August 2002

Andrzej Szepietowski
Andrzej Szepietowski*
Affiliation:
Institute of Mathematics, University of Gdańsk, ul Wita Stwosza 57, 80952 Gdańsk, Poland
Get access

Abstract

In [6] it was shown that shuffle languagesare contained in one-way-NSPACE(log n) and in P.In this paper we show that nondeterministic one-way logarithmic spaceis in some sense the lower bound for accepting shuffle languages.Namely, we show that there exists a shuffle language which is notaccepted by any deterministic one-way Turing machine with space bounded bya sublinear function, and that there exists a shuffle language which isnot accepted with less than logarithmic space even if we allow two-waynondeterministic Turing machines.

Keywords

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 33 , Issue 3 , May 1999, pp. 303 - 307
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Gischer, J.L., Shuffle languages, Petri nets and context sensitive grammars. Comm. ACM 24 (1981) 597-605. CrossRef
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading MA (1979).
Jantzen, M., Extending regular operations with iterated shuffle. TCS 38 (1985) 223-247. CrossRef
Jedrzejowicz, J., On the enlargement of the class of regular languages by shuffle closure. IPL 16 (1983) 51-54. CrossRef
Jedrzejowicz, J., Nesting of shuffle closure is important. IPL 25 (1987) 363-367. CrossRef
J. Jedrzejowicz and A. Szepietowski, Shuffle languages are in P, Preprint No. 124, Mathematical Institute, University of Gdansk, ul. Wita Stwosza 57, 80-952 Gdansk, Poland, March 1997, Theoret. Comput. Sci., accepted.
W.E. Riddle, Software system modelling and analysis, Tech. Report, Dept. of Computer and Communication Sciences, University of Michigan RSSM25 (1976).
A.C. Shaw, Software descriptions with flow expressions. IEEE Trans. Software Engrg SE-4 (1978) 242-254.
A. Szepietowski, Turing Machines with Sublogarithmic Space, LNCS 843, Springer-Verlag, Berlin (1994).
Warmuth, M.K. and Haussler, D., On the complexity of iterated shuffle. J. CSS 28 (1984) 345-358.