Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 32))

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.E. Knuth, Semantics of context — free languages. Mathematical Systems Theory, Vol. 2, No. 2, 1965.

    Google Scholar 

  2. В.Н. Редько, Интерпретированные языки и интерпретаторы. Журн. "Кибернетика", No 5, 1969.

    Google Scholar 

  3. А.В.Анисимов, Некоторые алгоритмические вопросы для языка Дика. Доклады АН СССР, т. 14, No 4, 1973.

    Google Scholar 

  4. А.В. Анисимов, О некоторых алгоритмических вопросах для групп и контекстно — свободных языков. Журн. "Кибернетика", No2, 1972.

    Google Scholar 

  5. А.В. Анисимов, О групповых языках. Журн. "Кибернетика", No 4, 1971.

    Google Scholar 

  6. J.E. Hopcroft, On the equivalence and containmenment problems for context — free grammars. Mathematical Systems Theory, 3 (1969) 119–124.

    Article  Google Scholar 

  7. S.A. Greibach, A note on pushdown store automata and regular systems. Proc. Am. Math. Soc., 18 (1967), 263–268.

    Google Scholar 

  8. D.E. Knuth, On the translation of languages from left to right. Information and Control, V.8, No. 6, 1965.

    Google Scholar 

  9. В.Н. Редько, Дефиниторные алгебры и алгебры языков. Журн. "Кибернетика", No 4, 1973.

    Google Scholar 

  10. А.В. Анисимов, Фр. Д. Зайферт, Об алгебре регулярных языков и теореме Хаусона, "Математические заметки", 1975 (to be published)

    Google Scholar 

  11. A.G. Howson, On the intersection of finitely generated free groups. Journal of the London Mathematical Society, V.29 (1954), 428–434.

    Google Scholar 

  12. L. Greenberg, Discrete groups of motions, Canadian Journal of Mathematics, 12 (1960), 415–426.

    Google Scholar 

  13. Д.И. Молдаванский, О пересечении конечно порожденных под — групп. Сибирский математически журнал, т. 9, No 6, 1968.

    Google Scholar 

  14. R.G. Burns, on finitely generated subgroups of amalgamatea products of two groups, Trans. Math. Soc., 169 (1972), 293–306.

    Google Scholar 

Translation of Russian references

  1. Redko, V.N., Interpreted languages and interpreters, Kibernetika (Kiev) (1969), No. 5.

    Google Scholar 

  2. Anisimov, A.V., Some algorithmic problems concerning the Dyck language, Dokl. Akad. nauk SSSR, 14 (1973), No. 4.

    Google Scholar 

  3. Anisimov, A.V., On some algorithmic problems concerning groups and context-free languages, Kibernetika (Kiev) (1972), No. 2.

    Google Scholar 

  4. Anisimov, A.V., On group languages. Kibernetika (Kiev) (1971), No. 4.

    Google Scholar 

  5. Redko, V.N., Definition algebras and language algebras, Kibernetika (Kiev) (1973), No. 4.

    Google Scholar 

  6. Anisimov, A.V., Zaifert, Fr.D., On algebra of regular languages and Howson's theorem, Mat. Zametki, 1975.

    Google Scholar 

  7. Moldavanskii, D.I., On intersection of finitely generated subgroups, Sib. mat. zhurn. 9 (1968) No. 6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anisimov, A.V. (1975). Languages over free groups. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_191

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_191

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics