Skip to main content
SpringerLink
Log in

Generalized finite generators and identity problems in definitive algebras of regular events

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. M. Glushkov, “Abstract theory of automata,” Usp. Mat. Nauk,16, No. 5 (1961).

    Google Scholar 

  2. S. Ginzburg, Mathematical Theory of Context-Free Languages, McGraw-Hill (1966).

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

  4. P. S. Novikov, “The algorithmic unsolvability of the identity problem of words in the group theory,” Tr. Mat. Inst. Akad. Nauk SSSR,44 (1955).

  5. V. N. Red'ko, “The algebra of commutative events,” Ukr. Mat. Zh.,16, No. 2 (1964).

    Google Scholar 

  6. S. A. Greibach, “Push-down store automata and regular systems,” Proc. Amer. Math. Soc.,18, No. 2 (1967).

Download references

Authors
  1. L. P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 25–28, January–February, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, L.P. Generalized finite generators and identity problems in definitive algebras of regular events. Cybern Syst Anal 11, 28–33 (1975). https://doi.org/10.1007/BF01069939

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation