On normalizing, non-terminating one-rule string rewriting systems

DOI10.1016/S0304-3975(00)00167-5zbMath0944.68085MaRDI QIDQ1575660

Alfons Geser

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

semi-Thue systemstring rewriting systemterminatinginnermost terminatingnormalizingone-rulerightmost terminatingsingle-rule

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Termination proofs for string rewriting systems via inverse match-bounds

Cites Work

• Unnamed Item
• Unnamed Item
• On termination of confluent one-rule string-rewriting systems
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• Termination of term rewriting using dependency pairs
• Calcul de longueurs de chaînes de réécriture dans le monoïde libre
• Non-Looping String Rewriting
• On confluence of one-rule trace-rewriting systems

This page was built for publication: On normalizing, non-terminating one-rule string rewriting systems