Skip to main content
SpringerLink
Log in

The tree equivalence problem for linear recursion schemes

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1996)

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

  • 136 Accesses

Abstract

In the paper, a complete system of transformation rules preserving the tree equivalence and a polynomial-time algorithm deciding the tree equivalence of linear polyadic recursion schemes are proposed.

Partially supported by the Russian Foundation of Fundamental Research under Grants 93-012-576 and by Russian Committee on Higher Education under Grants ’Formal methods for program analysis and transformation’.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beeri C. An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown machines TCS 3, 305–320 (1976)

    Google Scholar 

  2. Courcelle B. On jump deterministic pushdown automata. Math. Systems Theory, 11, 87–109 (1977)

    Google Scholar 

  3. Courcelle B. A representation of trees by languages. TCS 6: 225–279, 7: 25–55 (1978)

    Google Scholar 

  4. Downey P.J., Sethi R., Tarjan R. J. Variations on the common subexpression problem. J.ACM 27: 4, 758–771 (1980).

    Google Scholar 

  5. Gallier J.H. DPDA's in’ Atomic normal form ‘and applications to equivalence problems. TCS 14: 2, 155–186 (1981)

    Google Scholar 

  6. Garland S.J., Luckham D.C. Program schemes, recursion schemes and formal languages. — Report UCLA-ENG-7154, June 1971, School of Engineering and Applied Science, University of California, Los Angeles.

    Google Scholar 

  7. Kam J.B., Ullman J.D. Monotone data flow analysis frameworks. Acta Informatica 7: 3, 305–318 (1977)

    Google Scholar 

  8. Kotov V.E., Sabelfeld V.K. Theory of program schemata. Moskow: Nauka, 1991, 246 P. (in Russian)

    Google Scholar 

  9. Rosen B.K. Program equivalence and context-free grammars. JCSS 11, 358–374 (1975)

    Google Scholar 

  10. Sabelfeld V.K. Tree equivalence of linear recursive schemata is polynomial-time decidable. IPL 13: 4, 147–153 (1981)

    Google Scholar 

  11. Valiant L.G. The Equivalence problem for deterministic finite-turn pushdown machines. Information and Control 5, 123–133 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A. P. Ershov Institute of Informatics Systems, 630090, Novosibirsk, Russia

    V. K. Sabelfeld

Authors
  1. V. K. Sabelfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dines Bjørner Manfred Broy Igor V. Pottosin

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sabelfeld, V.K. (1996). The tree equivalence problem for linear recursion schemes. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-62064-8_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62064-8

  • Online ISBN: 978-3-540-49637-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation