Skip to main content
Log in

Strict sets and finite semigroup coverings

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. A. H. Clifford and G. B. Preston, Algebraic Theory of Semigroups, Am. Math. Soc. (1967).

  2. A. Nerode, “Linear automation transformations,” Proc. Am. Math. Soc.,9, No. 4 (1958).

  3. M. O. Rabin and D. Scott, “Finite automata and problems of their solution,” Cybernetic Collection [Russian translation], No. 4, Mir, Moscow (1962).

    Google Scholar 

  4. P. G. Kontorovich, “Groups with basis decomposition. IV,” Mat. Sb.,26 (1950).

  5. L. P. Lisovik, “Finite coverings of regular events by strict sets,” Dokl. Akad. Nauk UkrSSR, Kiev, No. 5 (1979).

    Google Scholar 

  6. V. N. Red'ko, “Definer algebras and language algebras,” Kibernetika, No. 4 (1973).

  7. L. P. Lisovik, “On the embedding problem in regular subsets for the free product of groups,” VINITI Dep. No. 3406-78 (1978).

  8. B. H. Neumann, “Groups covered by permutable subsets,” J. London Math. Soc.,29, No. 114 (1954).

  9. D. S. Passman, “Groups rings a satisfying polynomial identity,” J. Algebra.20, No. 1 (1972).

  10. P. G. Kontorovich “Groups with basis decomposition. II,” Mat. Sb.,19, No. 2 (1946).

  11. L. P. Lisovik, “Equivalence problem for finitely ambiguous finite automata over semigroups,” Kibernetika, No. 4 (1979).

Download references

Authors

Additional information

Translated from Kibernetika, No. 1, pp. 12–16, January–February, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, L.P. Strict sets and finite semigroup coverings. Cybern Syst Anal 16, 13–17 (1980). https://doi.org/10.1007/BF01099355

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01099355

Keywords

Navigation