Skip to main content
SpringerLink
Log in

Transformation of computation formulae in systems of recurrence relations

  • Applications And Systems
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

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

Included in the following conference series:

  • 153 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Zima E.V. Automatic construction of systems of recurrence relations. Computat. math. and math. phys., 1984, Vol. 24,N 6, p. 193–197.

    Article  Google Scholar 

  2. Zima E.V. Transformations of expressions associated with systems of recursion relations. Moscow University computat. math. and cybernetics, 1985, N 1, p. 60–66.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facul. Computat. Math. and Cybernetics, Moscow State University, SU — II9899, Moscow, USSR

    E.V. Zima

Authors
  1. E.V. Zima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zima, E. (1989). Transformation of computation formulae in systems of recurrence relations. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation