Skip to main content
SpringerLink
Log in

Definer algebras and algebras of languages

  • 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,” Uspekhi Matem. Nauk,16, No. 5 (101) (1961).

  2. S. C. Kleene, “Representation of events in nerve nets and finite automata,” in: Automata Studies (edited by C. E. Shannon and J. McCarthy), Princeton University Press, Princeton (1956), pp. 3–41.

    Google Scholar 

  3. K. A. Mikhailova, “The embedding problem for direct products of groups,” Dokl. Akad. Nauk SSSR,119 (1958).

  4. V. N. Red'ko, “On the defining set of relations of the algebra of regular events,” Ukrainsk. Matem. Zh., No. 1 (1964).

  5. V. N. Red'ko, “On the algebra of commutative events,” Ukrainsk. Matem. Zh., No. 2 (1964).

  6. V. N. Red'ko, “Certain questions in the theory of languages,” Kibernetika, No. 4 (1965).

  7. V. N. Red'ko, “Parametric programming system,” in: Proceedings of the First All-Union Conference on Programming [in Russian], Kiev (1968).

  8. V. N. Red'ko, Parametric Programming System, Dissertation, Cybernetics Institute, Academy of Sciences of the Ukrainian SSR, Kiev (1969).

    Google Scholar 

  9. V. N. Red'ko, “Parametric grammar and the problem of the syntactic analysis of languages,” in: Proceedings of the Second All-Union Conference on Programming [in Russian], Novosibirsk (1970).

  10. A. Salomaa, “Axiomatization of the algebra of events realized by logical nets,” in: Problems of Cybernetics [in Russian], Vol. 17, Nauka, Moscow (1966).

    Google Scholar 

  11. Yu. I. Yanov, “On invariant operations over events,” in: Problems of Cybernetics [in Russian], Fizmatgiz, Moscow (1964).

    Google Scholar 

  12. Yu. I. Yanov, “On the equivalence of transformations of regular expressions,” in: Theory of Finite and Probabilistic Automata [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  13. T. H. Conway, “On axioms for regular expressions,” in: Brief Communications from the International Congress of Mathematicians, 1966, contained in: Information Bulletin No. 7, August 23 [in Russian], Section 13, Moscow (1966).

  14. A. Ginzburg, Algebraic Theory of Automata, Academic Press (1968).

  15. J. Gruska, “On a classification of context-free languages,” Kibernetika,3, No. 1 (1967).

  16. J. Gruska, “A characterization of context-free languages,” Journal of Computers and Systems Sciences,5, No. 4 (1971).

  17. R. J. Parikh, “On context-free languages,” Journal of the ACM, No. 13 (1966).

  18. A. Salomaa, Theory of Automata, Pergamon Press, New York (1969).

    Google Scholar 

  19. Topi Urponen, “On axiom systems for regular expressions on equations involving languages,” Turun Yliopisto, Turku (1971).

    Google Scholar 

  20. J. P. McWhirter, “Substitution expressions,” J. Computers and Systems Sciences,5, No. 6 (1971).

  21. M. K. Yntema, “Cap expression for context-free languages,” Information and Control,18, No. 4 (1971).

Download references

Authors
  1. V. N. Red'ko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 57–63, July–August, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Red'ko, V.N. Definer algebras and algebras of languages. Cybern Syst Anal 9, 609–616 (1973). https://doi.org/10.1007/BF01068584

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation