Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules-Reference-Cited by-同舟云学术

Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules

Published:2005 Issue: Volume: Page:164-176
ISSN:0302-9743
Container-title:Automated Deduction – CADE-20
language:
Short-container-title:

Author:

Godoy Guillem,Tiwari Ashish

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11532231_12.pdf

Reference17 articles.

1. Lecture Notes in Computer Science;C. Borralleras,2000

2. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on (1997), http://www.grappa.univ-lille3.fr/tata

3. Contejean, E., Marche, C., Monate, B., Urbain, X.: CiME, http://cime.lri.fr/

4. Dauchet, M.: Simulation of Turing machines by a regular rewrite rule. Theoretical Computer Science 103(2), 409–420 (1992)

5. Lecture Notes in Computer Science;N. Dershowitz,1981

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

1. A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems;Applicable Algebra in Engineering, Communication and Computing;2010-11-11

2. Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories;Logical Methods in Computer Science;2010-08-25

3. Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs;IEICE Transactions on Information and Systems;2010

4. Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems;Lecture Notes in Computer Science;2006

5. Primitive Rewriting;Processes, Terms and Cycles: Steps on the Road to Infinity;2005