Relational Methods in Computer Science

DOI10.1007/11734673zbMATH Open1185.68376OpenAlexW2482623798MaRDI QIDQ5899320FDOQ5899320

Authors: Georg Struth 

Publication date: 2 May 2007

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

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

Recommendations

• Knuth-Bendix completion for non-symmetric transitive relations
• scientific article; zbMATH DE number 4076598
• scientific article; zbMATH DE number 3856444
• scientific article; zbMATH DE number 3928345
• scientific article; zbMATH DE number 1375600

Mathematics Subject Classification ID

Data structures (68P05) Grammars and rewriting systems (68Q42)

Cited In (4)

• Solving divergence in Knuth--Bendix completion by enriching signatures
• PATCH graphs: an efficient data structure for completion of finitely presented groups
• Knuth-Bendix completion for non-symmetric transitive relations
• KBCV – Knuth-Bendix Completion Visualizer

This page was built for publication: Relational Methods in Computer Science

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