Skip to main content
SpringerLink
Log in

On several kinds of space-bounded on-line multicounter automata

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

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

Included in the following conference series:

  • 109 Accesses

Abstract

In this paper several ways to define space-bounded computations will be considered. All these notions are equivalent for sufficiently powerful automata. For "weaker" acceptors, however, it is possible that the recognition power strictly depends on small details in the definition of computing within the space bound. We discuss these questions for several kinds of space-bounded on-line multicounter automata.

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. Fischer, P.C.: Turing machines with restricted memory access. Information and Control 9(1966), 364–379.

    Google Scholar 

  2. Fischer, P.C.; Meyer, A.R.; Rosenberg, A.L.: Counter machines and counter languages. Math. Syst. Theory 2(1968), 265–283.

    Google Scholar 

  3. Greibach, S.A.: Remarks on the complexity of nondeterministic counter languages. TCS 1(1976), 269–288.

    Google Scholar 

  4. Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. TCS 7(1978), 311–324.

    Google Scholar 

  5. Hemmerling, A.: Zur Raumkompliziertheit von Berechnungs-, Erkennungs-und Entscheidungsprozessen. Preprint, Greifswald 1979.

    Google Scholar 

  6. Hemmerling, A.: D≠ND für mehrdimensionale Turingautomaten mit sublogarithmischer Raumschranke. EIK 19(1983), 85–94.

    Google Scholar 

  7. Inoue, T.; Takanami, I.: On-line n-bounded multicounter automata. Information Sciences 17(1979), 239–251.

    Google Scholar 

  8. Inoue, T.; Takanami, I.; Nakamura, A.; Ae, T.: One-way simple multi-head finite automata. TCS 9(1979), 311–328.

    Google Scholar 

  9. Shepherdson, J.C.; Sturgis, H.E.: Computability of recursive functions. JACM 10(1963), 217–255.

    Google Scholar 

  10. Voelkel,L.: Language recognition by linear bounded and copy programs. FCT-Conference 1979, 491–495.

    Google Scholar 

  11. Voelkel, L.: Untersuchungen zum Leistungsvermögen von Automaten. Dissertation B, Greifswald 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Ernst-Moritz-Arndt-Universität, Jahnstraße 15a, DDR-2200, Greifswald

    L. Voelkel

Authors
  1. L. Voelkel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voelkel, L. (1985). On several kinds of space-bounded on-line multicounter automata. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028830

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation