Abstract
Necessary sufficient conditions for the existence of nontrivial parallel decompositions of different kinds of sequential machines are stated. Parallel reducibilities with respect to states for any machine, with respect to a semigroup for permutation machines with a semisimple group, and with respect to representation for clocks are considered.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hartmanis J., Stearus R.E. Algebraic structure theory of sequential machines. Prentice-Hall,Inc. Englewood Cliffs, N.Y.,1966, 210 p.
Algebraicheskaya theoriya avtomatov, yazikov i polugrupp. Edited by M.A. Arbib. Statistika, M., 1975, 3353.
Kudrayavtsev V.B., Alyoshin S.V., Podkolsyn A.S. Elementi theorii avtomatov. Izd-vo MGU, M., 1978, 216 s.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Evtushenko, N.V. (1987). Conditions for existence of nontrivial parallel decompositions of sequential machines. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_29
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive