Reducing the gradedness problem of string rewriting systems to a termination problem

DOI10.1051/ITA/2015008zbMATH Open1347.68201OpenAlexW2284055555MaRDI QIDQ3465631FDOQ3465631

Authors: Itamar Stein 

Publication date: 22 January 2016

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2015008

Recommendations

• scientific article; zbMATH DE number 789389
• On deciding the confluence of a finite string-rewriting system on a given congruence class
• Termination and derivational complexity of confluent one-rule string-rewriting systems
• Algorithms and reductions for rewriting problems
• On termination of confluent one-rule string-rewriting systems

zbMATH Keywords

terminationstring rewritinggradedness

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (2)

• Decidability of termination of grid string rewriting rules
• Implementation and Application of Automata

This page was built for publication: Reducing the gradedness problem of string rewriting systems to a termination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465631)