Skip to main content

Characterization of derivation sets of formal systems

  • Formale Sprachen
  • Conference paper
  • First Online:
Book cover GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.L. Post, Formal reduction of the general combinatorial decision problem AJM 65 (1943), pp. 197–215

    Google Scholar 

  2. M. Minsky, Computation. Finite and Infinite Machines (London 1972)

    Google Scholar 

  3. R.J. Nelson, Introduction to Automata (New York 1968)

    Google Scholar 

  4. J.E. Hopcroft/ J.D. Ullman, Formal Languages and their Relation to Automata (Reading 1969)

    Google Scholar 

  5. H. Maurer, Theoretische Grundlagen der Programmiersprachen (Mannheim 1969)

    Google Scholar 

  6. Two finger system

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Kudlek, M. (1973). Characterization of derivation sets of formal systems. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039150

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06527-2

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics