Summary
First the problem is solved how one can decide whether an arbitrary finite semigroup H is linearly A-realizable, i.e., whether there exists a linearly realizable finite automaton having a semigroup isomorphic to H. This leads to a question about the existence of certain generating subsets of H. The determination of these subsets is rather complicated in case H-HH=Ø and very simple in case H-HH#Ø. But in the first case we are able to clear up completely the structure of the semigroups which are linearly A-realizable: These are exactly the finite right groups which have maximal subgroups of the type described by Ecker in [4]. In the second case we get only necessary structure conditions. Among other things we shall see: If a semigroup H is linearly A-realizable one can define a congruence relation ρ on it having the property, that H is isomorphic to a semigroup of a strongly connected and linearly realizable automaton iff the so-called index of H equals the index of H/ρ. Developing these results about semigroups we obtain at the same time many structure theorems about linearly realizable automata.
Similar content being viewed by others
References
Arbib, M. (ed.): Algebraic theory of machines, languages, and semigroups. New York: Academic Press 1968
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups, Vol. 1. Providence, Rhode Island: Am. Math. Soc. 1961
Deussen, P.: Halbgruppen und Automaten. Berlin-Heidelberg-New York: Springer 1971
Ecker, K.: On the semigroup of a linear nonsingular automaton. Math. Systems Theory 6, 353–358 (1972)
Ecker, K.: Algebraische Eigenschaften linearer Automaten. Bericht der GMD Nr 87, Bonn. 1974
Eichner, L.: Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern. Acta Informat. 3, 75–100 (1974)
Eichner, L.: Total lineare Realisierbarkeit endlicher Automaten. Acta Informat. 3, 385–397 (1974)
Eichner, L.: Homomorphe Darstellungen endlicher Automaten in linearen Automaten. EIK 9, 587–613 (1973)
Eichner, L.: Bemerkungen zu den Übergangshalbgruppen linear realisierbarer Automaten. In: Lecture Notes in Comp. Sci., Vol. 48, pp. 234–258. Berlin-Heidelberg-New York: Springer 1977
Fujimoto, S.: On the structure of the semigroups generated by linear automata. Systems, Computers, Controls 5, 21–29 (1974)
Hartfiel, D.J., Maxson, C.J.: A semigroup characterization of a linearly realizable automaton over GF(p). J. Comput. System. Sci. 14, 150–155 (1977)
Hartmanis, J., Walter, H.: Group theoretic characterization of linear permutation automata. J. Comput. System. Sci. 7, 168–188 (1973)
Hall, M.: The theory of groups; New York: Macmillan 1959
Hotz, G., Walter, H.: Automatentheorie und formale Sprachen, Bd. 2. Mannheim: Bibliographisches Institut 1969
Kandzia, P.: Zu den Übergangshalbgruppen linearer Automaten. Tagungsbericht: Automatentheorie und formale Sprachen 1969. Mannheim: Bibliographisches Institut 1970
Stucky, W.: Linear realisierbare Automaten. Universität Saarbrücken, Dissertation, 1969
Zalcstein, Y.: On the semigroups of linear sequential machines. Internat. J. Comput. Information Sci. 2, 25–28 (1973)
Hartfiel, D.J., Maxson, C.J.: Groups which are isomorphic to a semigroup of a linear nonsingular subautomaton. Discrete Math. 22, 105–109 (1978)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Eichner, L. The semigroups of linearly realizable finite automata. I. Acta Informatica 10, 341–367 (1978). https://doi.org/10.1007/BF00265678
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00265678