Summary
After having compiled basic concepts (§ 1) we give a necessary and sufficient condition under which a finite sequential machine a is K-linearly realizable where K is a finite field (§ 2, Erster Hauptsatz). This theorem enables us to define a system of linear equations with integer coefficients, the so-called characteristic system of a, which gives the possibility to decide whether or not a is K-linearly realizable (§ 3). Research about divisors of certain determinants constructed with the help of the characteristic system gives us a survey about all finite fields K having the property that a is K-linearly realizable (§§ 4, 5).
Similar content being viewed by others
Literatur
Eichner, L.: Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern. Dissertation, Universität Freiburg i.Br. 1971
Herman, G. T.: When is a sequential machine the realization of another? Math. Systems Theory 5, 115–127 (1971)
Herman, G. T.: Every finite sequential machine is linearly realizable. J. Computer and System Sciences 5, 489–510 (1971)
Hotz, G., Walter, H.: Automatentheorie und formale Sprachen II. BI-Hochschultaschenbücher 822/822 a. Mannheim-Wien-Zürich: Bibliographisches Institut 1969
Reusch, B.: Lineare Automaten. BI-Hochschultaschenbücher 708. MannheimWien-Zürich: Bibliographisches Institut 1969
Reusch, B.: Zur Realisierung von Automaten über Algebren. Berichte der Gesellschaft für Mathematik und Datenverarbeitung, Bd. 38, Bonn 1971
Stucky, W.: Linear realisierbare endliche Automaten. Dissertation, Universität Saarbrücken 1969
Author information
Authors and Affiliations
Additional information
Die Arbeit ist ein Auszug der gleichnamigen Dissertation [1] des Verfassers.
Rights and permissions
About this article
Cite this article
Eichner, L. Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern. Acta Informatica 3, 75–100 (1973). https://doi.org/10.1007/BF00288654
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288654