Skip to main content
SpringerLink
Log in

Some algorithmic problems for groups and context-free 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. P. S. Novikov, “On algorithmic unsolvability of the identity problem,” Dokl. Akad. Nauk SSSR,85, No. 4 (1952).

  2. P. S. Novikov, “On algorithmic unsolvability of the identity problem of words in group theory,” Proceedings V. A. Steklov Mathematics Institute, Vol. 44, Mir, Moscow (1955).

    Google Scholar 

  3. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).

    Google Scholar 

  4. W. Magnus, “The identity problem for groups with one defining relation,” Uspekhi Matematicheskikh Nauk, No. 8, 365–376 (1941).

    Google Scholar 

  5. A. V. Anisimov, “On equations over free groups,” in: Theoretical Cybernetics, No. 1, Izd. IK AN UkrSSR, Kiev (1970).

    Google Scholar 

  6. A. V. Anisimov, “Group languages,” Kibernetika, No. 4 (1971).

  7. Y. Bar-Hillel, M. Perles, and E. Shamir, “On formal properties of simple phrase structure grammars,” Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung,14 (1961).

  8. B. H. Neumann, “Adjunction of elements to groups,” Journal of the London Mathematical Society,18 (1943).

  9. S. Ginsburg and S. A. Greibach, “Deterministic context-free languages,” Information and Control,9 (1966).

  10. S. Ginsburg, T. N. Hibbard, and T. S. Ullian, “Sequences in context-free languages,” Illinous Journal of Mathematics,9 (1965).

  11. E. F. Moore, “Gedanken experiments on sequential machines,” in: Automata Studies, Princeton University Press (1956).

  12. M. O. Rabin and D. Scott, “Finite automata and their decision problems,” IBM Journal of Research and Development,3 (1959).

  13. A. J. Korenjak and J. E. Hopcroft, “Simple deterministic languages,” IEEE Conference Record of 7th Annual Symposium on Switching and Automata Theory, Berkeley, California, October (1966).

  14. R. McNaughton, “Parenthesis grammars,” Journal of the ACM,14 (1967).

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 4–11, March–April, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Some algorithmic problems for groups and context-free languages. Cybern Syst Anal 8, 174–182 (1972). https://doi.org/10.1007/BF01068483

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation