Skip to main content
Springer Nature Link
Log in

Tabulator-Turingmaschine und Komplexität

Tabulator-turing machine and complexity

  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Es wird ein „Tabulator-Turingmaschine” genanntes Modell einer Turingmaschine definiert, die in einem Schritt mehrere Felder ihres Bandes überspringen kann und dadurch einer realen Datenverarbeitungsanlage näher kommt als eine Turingmaschine der üblichen Definition. Es wird gezeigt, daß diese Maschine zu anderen Komplexitätsklassen führen kann als eine normale mehrbändige Turingmaschine. Als Anwendung wird die Komplexität verschiedener Erkennungsverfahren für kontextfreie Sprachen angegeben.

Summary

A new model of a Turing Machine, called “Tabulator Turing Machine”, is defined. It can shift its head over several squares of the tape and is therefore more similar to a real computer than a normal Turing Machine. The complexity classes defined by this machine are different from those defined by a normal multitape Turing Machine. This device is applied to measure the complexity of several recognition procedures for context free languages.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Literatur

  1. Earley, J.: An Efficient Context-Free Parsing Algorithm. Comm. ACM13, 94–102 (1970).

    Google Scholar 

  2. Fischer, M. J., undA. L. Rosenberg: Limited Random Access Turing Machines. IEEE Conf. Rec. of 1968 Ninth Ann. Symp. on Switching and Automata Theory, Schenectady, New York, 356–367.

  3. Hennie, C. F.: On-Line Turing Machine Computations. IEEE Trans. Electr. Comp. EC-15, 35–44 (1966).

    Google Scholar 

  4. Hartmanis, J., undR. E. Stearns: On the Computational Complexity of Algorithms. Trans. Am. Math. Soc.117, 285–306 (1965).

    Google Scholar 

  5. Kasami, T.: A Note on Computing Time for Recognition of Languages Generated by Linear Grammars. Inf. Contr.10, 209–214 (1967).

    Google Scholar 

  6. Kosaraju, S. R.: Recognition of Context-Free and Stack Languages. IEEE Conf. Rec. of 1969 Tenth Ann. Symp. on Switching and Automata Theory, Waterloo, Ontario, 129–132.

  7. Kasami, T., undK. Torii: A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars. Journal ACM16, 423–431 (1969).

    Google Scholar 

  8. Schorr, C.-P.: Komplexität von Algorithmen mit Anwendung auf die Analysis. Universität Saarbrücken, Inst. Angew. Math. (1969).

  9. Weicker, R.: Erkennung von kontextfreien Sprachen durch Tabulator-Turingmaschinen. Arbeitsber. Inst. Math. Masch. Datenverarb., Univ. Erlangen, Bd. {vn3}, {snNr. 5} ({dy1970}).

  10. Woods, W. A., undS. Kuno: A Recognition Procedure for Arbitrary Context-Free Grammars and the Upperbound of Recognition Time. Comp. Lab. Harvard Univ., Rep. No. NSF-17, Cambridge, Mass., X1–X26 (1966).

  11. Younger, D. H.: Recognition and Parsing of Context-Free Languages in Timen 3. Inf. Contr.10, 189–208 (1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informationsverarbeitung II, Technische Universität Berlin, Ernst-Reuter-Platz 8, D-1, Berlin 10, Deutschland

    R. Weicker

Authors
  1. R. Weicker
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weicker, R. Tabulator-Turingmaschine und Komplexität. Computing 7, 264–274 (1971). https://doi.org/10.1007/BF02242353

Download citation

  • Received:

  • Issue Date:

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