Skip to main content
SpringerLink
Log in

Bottom-up tree pushdown automata and rewrite systems

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1991)

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

Included in the following conference series:

Abstract

Studying connections between term rewrite systems and bottom-up tree pushdown automata (tpda), we complete and generalize results of Gallier, Book and K. Salomaa. We define the notion of tail reduction free rewrite systems (trf rewrite systems). Using the decidability of inductive reducibility (Plaisted), we prove the decidability of the trf property. Monadic rewrite systems of Book, Gallier and K. Salomaa become an obvious particular case of trf rewrite systems. We define also semi-monadic rewrite systems which generalize monadic systems but keep their fair properties. We discuss different notions of bottom-up tree pushdown automata, that can be seen as the algorithmic aspect of classes of problems specified by trf rewrite systems. Especially, we associate a deterministic tpda with any left-linear trf rewrite system.

This research was performed while S. Vàgvölgyi was visiting the department of computer science (L.I.F.L, URA 369 CNRS, I.E.E.A), University of Lille Flandres-Artois. This work was supported in part by the "PRC Mathématiques et Informatique" and ESPRIT2 Working Group ASMICS.

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. R.V. Book, M. Jantzen and C. Wrathall, Monadic Thue Systems, Theoret. Comput. Sci. 19 (3)(1982) 231–252.

    Google Scholar 

  2. R.V. Book, Thue systems as Rewriting Systems, J. of Symbolic Computation, 3, (1987).

    Google Scholar 

  3. R.V. Book and J.H. Gallier, Reductions in Tree Replacement Systems, Theoretical Computer Science, 37, (1985).

    Google Scholar 

  4. J.L.Coquidé, M.Dauchet, R.Gilleron and S.Vàgvölgyi, Bottom-up tree pushdown automata and rewrite systems, Technical Report, I.T 190, L.I.F.L, Université de Lille.

    Google Scholar 

  5. J.L.Coquidé and R.Gilleron, Proofs and Reachability Problem for Rewrite Systems, IMYCS, to appear in Lec. Notes Comp. Sci, (1989).

    Google Scholar 

  6. M. Dauchet and S.Tison, Decidability of Confluence in Ground Term Rewriting Systems, Fondations of Computation Theory, Cottbus, Lec. Notes Comp. Sci., 199, (1985)

    Google Scholar 

  7. M.Dauchet and S. Tison, The theory of Ground Rewrite System is Decidable, IEEE Symposium on Logic in Computer Science, Philadelphie, to appear, (1990)

    Google Scholar 

  8. N.Dershowitz and J.P. Jouannaud, Rewrite systems, Handbook of Theoretical Computer Science, J.V.Leeuwen editor, North-Holland, to appear.(1989).

    Google Scholar 

  9. Z. Fülöp and S. Vàgvölgyi, Ground Term Rewriting rules for the Word Problem of Ground Term Equations, submitted paper, (1989).

    Google Scholar 

  10. J.H. Gallier and K.M. Schimpf, Parsing Tree Languages using Bottom-up Tree Automata with Tree Pushdown Stores, J. Computer Science, (1985).

    Google Scholar 

  11. F. Gecseg and M. Steinby, Tree automata, Akademiai Kiado, (1984).

    Google Scholar 

  12. J. Goguen, J.W. Thatcher, E. Wagner and E. Wright, An initial algebra approach to the specification correctness, and implementation of abstract data types, in: Current Trends in Programming Methodology Vol. 4 (Prentice-Hall, Englewood Cliffs, NJ, 1977) 80–149.

    Google Scholar 

  13. I. Guessarian, Pushdown Tree Automata, Math. Systems Theory, 16, (1983).

    Google Scholar 

  14. G. Huet, Confluent Reductions: Abstract properties and applications to Term Rewriting System, J.A.C.M., 27, (1980).

    Google Scholar 

  15. G.Huet and J-J. Levy, Call by need Computation in non-ambiguous linear Term Rewriting Systems, TR359, I.N.R.I.A., Le Chesnay, France, (1979).

    Google Scholar 

  16. G.Huet and D.C. Oppen, Equations and Rewrite Rules: A survey, in R.V.Book, ed., New York, Academic Press, Formal Language Theory: Perspectives and Open Problems, (1980).

    Google Scholar 

  17. D.A. Plaisted, Semantic Confluence Tests and Completion Methods, Information and Control, 65, (1985).

    Google Scholar 

  18. K. Salomaa, Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems, Journal of Comput. and Syst. Sci., 37, (1988).

    Google Scholar 

  19. K.M. Schimpf, A Parsing Method for Context-free Tree Languages, Ph.D., Univ. of Pennsylvania, (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFL, URA 369 CNRS, IEEA Université de Lille I, 59655, Villeneuve d'Ascq Cedex, France

    J-L. Coquidé & M. Dauchet

  2. LIFL, URA 369 CNRS, IUT A Université de Lille I, 59653, Villeneuve d'Ascq Cedex, France

    R. Gilleron

  3. Research Group on Theory of Automata, Hungarian Academy of Sciences, Somogyi u.7, H-6720, Szeged, Hungary

    S. Vàgvölgyi

Authors
  1. J-L. Coquidé
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Dauchet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Gilleron
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. Vàgvölgyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ronald V. Book

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coquidé, JL., Dauchet, M., Gilleron, R., Vàgvölgyi, S. (1991). Bottom-up tree pushdown automata and rewrite systems. In: Book, R.V. (eds) Rewriting Techniques and Applications. RTA 1991. Lecture Notes in Computer Science, vol 488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53904-2_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-53904-2_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53904-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation