Infinite Families of Finite String Rewriting Systems and Their Confluence

DOI10.1007/978-3-642-16242-8_28MaRDI QIDQ4933319zbMATH OpenOpenAlexFDO

Authors Jean-Pierre Jouannaud, Benjamin Monate

Publication date 12 October 2010

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00515395/file/main-easychair.pdf

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
• scientific article; zbMATH DE number 1324448
• Infinite string rewrite systems and complexity
• Some properties of finite special string-rewriting systems
• Restrictions of congruences generated by finite canonical string-rewriting systems
• On deciding confluence of finite string-rewriting systems modulo partial commutativity
• On deciding the confluence of a finite string-rewriting system on a given congruence class
• About the descriptive power of certain classes of finite string-rewriting systems
• INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class

Cited in

(2)

• On deciding confluence of finite string-rewriting systems modulo partial commutativity
• scientific article; zbMATH DE number 1324448 (Why is no real title available?)

This page was built for publication: Infinite Families of Finite String Rewriting Systems and Their Confluence

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