Skip to main content
Log in

Der programmierbare endliche automat

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The paper deals with finite automata with two tapes, the second tape of which is interpreted as programme tape. For fixed automata those classes: of languages are considered, which can be accepted by variation of the programmes. The representation of all regular sets over some alphabet X by a fixed one-way automaton proves to be impossible. This problem has not yet been solved for automata with rewind instructions and two-way automata, which are strongly more powerful than one-way automata.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literatur

  1. Rabin, M. O., Scott, D.: Finite automata and their decision problems. IBM Journal Vol. 3, number 2, 114–125 (1959).

    Google Scholar 

  2. Hopcroft/Ullman: Formal languages and their relation to automata. Reading (Mass.)-London: Addison-Wesley 1969.

    Google Scholar 

  3. Ginsburg: An introduction to mathematical machine theory. Palo Alto-London: Addison-Wesley, Publ. Comp. 1962.

    Google Scholar 

  4. Salomaa, Arto: Theory of automata. International series of monographs in pure and applied mathematics, vol. 100. Oxford: Pergamon Press, 1969.

    Google Scholar 

  5. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM Journal 3, 198–200 (1959).

    Google Scholar 

  6. Hotz/Walter: Automatentheorie und formale Sprachen II. Mannheim: Biblio-graphisches Institut 1969.

    Google Scholar 

  7. Rosenberg, A. L.: Multitape finite automata with rewind instructions. Journal of Computer and System Sciences 1, 299–315 (1967).

    Google Scholar 

  8. McNaughton, R.: The loop complexity of regular events. Information Sciences, vol. 1, number 3, 305–328 (1969).

    Google Scholar 

  9. Dejean, F., Schützenberger, M. P.: On a question of Eggan. Information and Control 9, 23–25 (1965).

    Google Scholar 

  10. Kaufholz, G.: Diplomarbeit, Institut für Angewandte Mathematik der Universität des Saarlandes, 1970.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Diese Arbeit ist ein Auszug aus der Diplomarbeit, die von Prof. Dr. G. Hotz vergeben und betreut wurde. Ihm möchte der Verfasser seinen Dank aussprechen für das sehr interessante Thema.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaufhol, G. Der programmierbare endliche automat. Acta Informatica 1, 225–241 (1972). https://doi.org/10.1007/BF00288687

Download citation

  • Received:

  • Issue Date:

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

Navigation