Elements of finite order for finite weight-reducing and confluent Thue systems
From MaRDI portal
Publication:1121013
zbMath0673.68025MaRDI QIDQ1121013
Paliath Narendran, Friedrich Otto
Publication date: 1988
Published in: Acta Informatica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65) Thue and Post systems, etc. (03D03)
Related Items (6)
An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group ⋮ Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Decision problems for finite special string-rewriting systems that are confluent on some congruence class ⋮ On groups presented by inverse-closed finite confluent length-reducing rewriting systems ⋮ On weakly confluent monadic string-rewriting systems
This page was built for publication: Elements of finite order for finite weight-reducing and confluent Thue systems
