Match-bounds revisited-Reference-Cited by-同舟云学术

Match-bounds revisited

Published:2009-11 Issue:11 Volume:207 Page:1259-1283
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Korp Martin,Middeldorp Aart

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference28 articles.

1. Match-bounded string rewriting systems;Geser;Applicable Algebra in Engineering, Communication and Computing,2004

2. On tree automata that certify termination of left-linear term rewriting systems;Geser;Information and Computation,2007

3. J. Endrullis, D. Hofbauer, J. Waldmann, Decomposing terminating rewrite relations, in: Proceedings of the Eighth International Workshop on Termination (WST), 2006, pp. 39–43.

4. Termination proofs for string rewriting systems via inverse match-bounds;Geser;Journal of Automated Reasoning,2005

5. Finding finite automata that certify termination of string rewriting systems;Geser;International Journal of Foundations of Computer Science,2005

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

1. Reachability, confluence, and termination analysis with state-compatible automata;Information and Computation;2017-04

2. Modular Complexity Analysis for Term Rewriting;Logical Methods in Computer Science;2014-04-01

3. Reachability Analysis with State-Compatible Automata;Language and Automata Theory and Applications;2014

4. Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering;Frontiers of Combining Systems;2013

5. Modular and Certified Semantic Labeling and Unlabeling;LEIBNIZ INT PR INFOR;2011