Advertisement

Characterization of derivation sets of formal systems

  • M. Kudlek
Formale Sprachen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2)

Keywords

Formal System Turing Machine Normal System Terminal Symbol Universal Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1).
    E.L. Post, Formal reduction of the general combinatorial decision problem AJM 65 (1943), pp. 197–215Google Scholar
  2. 2).
    M. Minsky, Computation. Finite and Infinite Machines (London 1972)Google Scholar
  3. 3).
    R.J. Nelson, Introduction to Automata (New York 1968)Google Scholar
  4. 4).
    J.E. Hopcroft/ J.D. Ullman, Formal Languages and their Relation to Automata (Reading 1969)Google Scholar
  5. 5).
    H. Maurer, Theoretische Grundlagen der Programmiersprachen (Mannheim 1969)Google Scholar
  6. 6).
    Two finger systemGoogle Scholar

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • M. Kudlek
    • 1
  1. 1.Institut für InformatikHamburg 13

Personalised recommendations