Zusammenfassung
Die Ergebnisse der Theorie linearer Automaten, die die Reduktion, das Zykelverhalten des autonomen Faktors und die Isomorphie zwischen dem autonomen und anderen Faktoren betreffen, werden weitgehend auf die quasilinearen Automaten übertragen. So wie die linearen Automaten Anlaß geben zur Einführung der zyklischen Codes, so die quasilinearen zur Definition von einer entsprechenden Klasse von Codes.
Summary
The results of the theory of linear automata which concern the reduction, the cycle lenghts of the autonomous factor, and the isomorphism between the autonomous and other factors of the automata are generalized to the quasilinear automata. As the linear automat gives rise to introduce the cylic codes, so the quasi cylic to a corresponding class of codes.
This is a preview of subscription content, log in via an institution to check access.
Literatur
Elspas, B.: The Theory of Autonomous Linear Sequential Networks, IRE Trans. CT-6, 45–60 (1959).
Gill, A.: State Graphs of Autonomous Linear Automata, in: Automata Theory, 176–180.
Hotz, G.: On the Mathematical Theory of Linear Sequential Networks. Switching Theory in Space Technology, pp. 11–19. (Aiken and Main, eds.) Stanford University Press. 1963.
Huffman, D. A.: The Synthesis of Linear Sequential Coding Networks. Information Theory, Transactions of the Third London Symposium on Information Theory pp. 77–95. London: Butterworth. 1955.
Huffman, D. A.: Linear Binary Sequence Transducers. Proceedings of an International Symposium on the Theory of Switching. Part I, pp. 189–203, Cambridge, Massachussets: Harvard University Press. 1959.
Meggit, J. E.: Error Correcting Codes for Correcting Bursts of Errors, IBM J. Research Develop.4, 329–334 (1960).
Author information
Authors and Affiliations
Additional information
Mit 3 Textabbildungen
Rights and permissions
About this article
Cite this article
Hotz, G. Quasilineare Automaten. Computing 2, 139–152 (1967). https://doi.org/10.1007/BF02239183
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02239183