scientific article; zbMATH DE number 7559287

DOI10.4230/LIPIcs.FSCD.2019.21MaRDI QIDQ5089023

Johannes Waldmann, Dieter Hofbauer, Alfons Geser

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2003.01696

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relative terminationlocally testable languagesemantic labelingoverlap closure

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Reachability, confluence, and termination analysis with state-compatible automata
• Termination of string rewriting proved automatically
• Match-bounded string rewriting systems
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Locally testable languages
• Local Termination: theory and practice
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Root-Labeling
• Transforming termination by self-labelling
• Non-Looping String Rewriting
• Modular and Certified Semantic Labeling and Unlabeling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: