On tree automata that certify termination of left-linear term rewriting systems
From MaRDI portal
Publication:876043
DOI10.1016/j.ic.2006.08.007zbMath1112.68077OpenAlexW2111433946MaRDI QIDQ876043
Dieter Hofbauer, Alfons Geser, Johannes Waldmann, Hans Zantema
Publication date: 16 April 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.08.007
Related Items
Unnamed Item, Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems, Automated Complexity Analysis Based on the Dependency Pair Method, Symbol different term rewrite systems, Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems, Reachability, confluence, and termination analysis with state-compatible automata, From Outermost Termination to Innermost Termination, Beyond Dependency Graphs, A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems, Automatic Termination, Match-bounds revisited, Increasing interpretations, Increasing Interpretations, Analyzing innermost runtime complexity of term rewriting by dependency pairs
Uses Software
Cites Work
- Reachability analysis over term rewriting systems
- Deleting string rewriting systems preserve regularity
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Termination of string rewriting proved automatically
- Decidability for left-linear growing term rewriting systems.
- Match-bounded string rewriting systems
- Termination of context-sensitive rewriting
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
- Term Rewriting and Applications
- Term Rewriting and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
