Decidability of Termination of Grid String Rewriting Rules

DOI10.1137/S009753979833297XzbMath1008.68063OpenAlexW2001087572MaRDI QIDQ2784496

Alfons Geser

Publication date: 23 April 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979833297x

zbMATH Keywords

terminationsemi-Thue systemstring rewriting systemone-rulegrid ruletotal division order

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

On rationally controlled one-rule insertion systems ⋮ Reverse mathematical bounds for the termination theorem ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ Decision problems for semi-Thue systems with a few rules ⋮ On prefixal one-rule string rewrite systems

This page was built for publication: Decidability of Termination of Grid String Rewriting Rules