Infinite, canonical string rewriting systems generated by completion

DOI10.1007/BFB0013081MaRDI QIDQ4255520zbMATH OpenFDO

Authors Andrea Sattler-Klein

Publication date 16 August 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0013081

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Grammars and rewriting systems (68Q42)

Recommendations

• Infinite string rewrite systems and complexity
• Infinite Families of Finite String Rewriting Systems and Their Confluence
• Restrictions of congruences generated by finite canonical string-rewriting systems
• Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
• Complete involutive rewriting systems
• The derivational complexity of string rewriting systems
• Some properties of finite special string-rewriting systems
• scientific article; zbMATH DE number 1836320
• Termination proofs for string rewriting systems via inverse match-bounds
• Completing a finite special string-rewriting system on the congruence class of the empty word

Cited in

(6)

• Complete involutive rewriting systems
• The Knuth-Bendix Completion Procedure and Thue Systems
• scientific article; zbMATH DE number 4074464 (Why is no real title available?)
• Infinite Families of Finite String Rewriting Systems and Their Confluence
• Divergence phenomena during completion
• Linear completion

This page was built for publication: Infinite, canonical string rewriting systems generated by completion

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