Proofs and reachability problem for ground rewrite systems-Reference-Cited by-同舟云学术

Proofs and reachability problem for ground rewrite systems

Published:1990 Issue: Volume: Page:120-129
ISSN:0302-9743
Container-title:Aspects and Prospects of Theoretical Computer Science
language:
Short-container-title:

Author:

Coquidé J. L.,Gilleron R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-53414-8_34

Reference17 articles.

1. Brainerd, W.S, Tree generating regular systems, Inf. and control, 14 (1969), pp217–231.

2. Coquidé, J.L., Ph.D, Lille, to appear. (1990).

3. Courcelle, B.,On recognizable sets and tree automata, Resolution of Equations in Algebraic Structures, Academic Press, M.Nivat & H. Ait-Kaci edts, (1989).

4. Dauchet, M., Deruyver, A., "VALERIANN":Compilation of Ground Term Rewriting Systems and Applications, Rewriting Technics and Applications, (1989), Lec. Notes Comp. Sci., 355(Dershowitz ed.).

5. Dauchet, M., Heuillard, P., Lescanne, P., Tison, S., Decidability of the Confluence of Ground Term Rewriting Systems, 2nd Symposium on Logic in Computer Science, New-York, IEEE Computer Society Press (1987)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decidable call-by-need computations in term rewriting;Information and Computation;2005-01

2. Model-Checking Infinite Systems Generated by Ground Tree Rewriting;Lecture Notes in Computer Science;2002

3. Ground Tree Rewriting Graphs of Bounded Tree Width;STACS 2002;2002

4. Rigid Reachability;Advances in Computing Science ASIAN 98;1998

5. Bottom-up tree pushdown automata and rewrite systems;Rewriting Techniques and Applications;1991