Skip to main content
SpringerLink
Log in

Two applications of fürer's counter to one-tape nondeterministic TMs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.V. Book and S.A. Greibach, Quasi-realtime languages, Math. Sys. Theory, 4(1970), pp.97–111

    Google Scholar 

  2. M. Fürer, The tight deterministic time hierarchy, Proc. 14th Annual ACM Symposium on Theory of Computing, (1982), pp.8–16

    Google Scholar 

  3. J. Hartmanis, Size arguments in the study of computation speeds, Proc. Symp. on Computers and Automata, Polytechn. Inst. Brooklyn, (1965)

    Google Scholar 

  4. J.E. Hopcroft and J.D. Ullman, Relations between time and tape complexities, J. Assoc. Comp. Mach., 15 (1968), pp.414–427

    Google Scholar 

  5. O.H. Ibarra and S. Moran, Some time-space tradeoffs results concerning single-tape and offline TMs, SIAM J. Comput., 12(1983), pp.388–394

    Google Scholar 

  6. M. Liśkiewicz and K. Loryś, Fast simulations of time-bounded TMs by space-bounded ones, Report N-187, Institute of Computer Science, University of Wrocław, Wrocław 1987

    Google Scholar 

  7. W.J. Paul, On time hierarchies, J. Comput. Systems Sci., 19(1979), pp.197–202

    Google Scholar 

  8. W.J. Paul, E.J. Prauss and R. Reischuk, On alternation I, Acta Informatica, 14(1980), pp.243–255

    Google Scholar 

  9. M.S. Paterson, Tape bounds for time-bounded Turing machines, J. Comput. Systems Sci., 6(1972), pp.116–124

    Google Scholar 

  10. J.I. Seiferas, M.J. Fischer and A.R. Meyer, Separating nondeterministic time complexity classes, J. Assoc. Comp. Mach., 25(1978), pp.146–167.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Przesmyckiego 20, 51-151, Wrocław, Poland

    Krzysztof Loryś & Maciej Liśkiewicz

Authors
  1. Krzysztof Loryś
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Liśkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loryś, K., Liśkiewicz, M. (1988). Two applications of fürer's counter to one-tape nondeterministic TMs. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017167

Download citation

  • DOI: https://doi.org/10.1007/BFb0017167

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation