scientific article; zbMATH DE number 2043544

MaRDI QIDQ4447248zbMATH OpenFDO

Authors Alfons Geser

Publication date 16 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2706/27060410.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• On termination of confluent one-rule string-rewriting systems
• Termination of String Rewriting with Matrix Interpretations
• On normalizing, non-terminating one-rule string rewriting systems
• Termination of string rewriting proved automatically
• Termination and derivational complexity of confluent one-rule string-rewriting systems
• Decidability of termination of grid string rewriting rules
• Sparse tiling through overlap closures for termination of string rewriting
• On prefixal one-rule string rewrite systems
• Termination proofs for string rewriting systems via inverse match-bounds

Cited in

(6)

• On prefixal one-rule string rewrite systems
• On termination of confluent one-rule string-rewriting systems
• A canonical automaton for one-rule length-preserving string rewrite systems
• Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System
• Termination and derivational complexity of confluent one-rule string-rewriting systems
• Termination proofs for string rewriting systems via inverse match-bounds

This page was built for publication:

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