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.
Similar content being viewed by others
Literatur
Rabin, M. O., Scott, D.: Finite automata and their decision problems. IBM Journal Vol. 3, number 2, 114–125 (1959).
Hopcroft/Ullman: Formal languages and their relation to automata. Reading (Mass.)-London: Addison-Wesley 1969.
Ginsburg: An introduction to mathematical machine theory. Palo Alto-London: Addison-Wesley, Publ. Comp. 1962.
Salomaa, Arto: Theory of automata. International series of monographs in pure and applied mathematics, vol. 100. Oxford: Pergamon Press, 1969.
Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM Journal 3, 198–200 (1959).
Hotz/Walter: Automatentheorie und formale Sprachen II. Mannheim: Biblio-graphisches Institut 1969.
Rosenberg, A. L.: Multitape finite automata with rewind instructions. Journal of Computer and System Sciences 1, 299–315 (1967).
McNaughton, R.: The loop complexity of regular events. Information Sciences, vol. 1, number 3, 305–328 (1969).
Dejean, F., Schützenberger, M. P.: On a question of Eggan. Information and Control 9, 23–25 (1965).
Kaufholz, G.: Diplomarbeit, Institut für Angewandte Mathematik der Universität des Saarlandes, 1970.
Author information
Authors and Affiliations
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
About this article
Cite this article
Kaufhol, G. Der programmierbare endliche automat. Acta Informatica 1, 225–241 (1972). https://doi.org/10.1007/BF00288687
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288687