scientific article; zbMATH DE number 3634526
From MaRDI portal
Publication:4195154
zbMath0408.20054MaRDI QIDQ4195154
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Thue and Post systems, etc. (03D03)
Related Items (15)
Thue systems as rewriting systems ⋮ Monoid presentations of groups by finite special string-rewriting systems ⋮ Unnamed Item ⋮ The word matching problem is undecidable for finite special string-rewriting systems that are confluent ⋮ On the descriptive power of special Thue systems ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ On groups presented by inverse-closed finite confluent length-reducing rewriting systems ⋮ Commutativity in groups presented by finite Church-Rosser Thue systems ⋮ Gilman's conjecture ⋮ Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems ⋮ Groups and NTS languages ⋮ On regularity of context-free languages ⋮ Units of special Church-Rosser monoids ⋮ Insertion languages ⋮ Complexity results on the conjugacy problem for monoids
This page was built for publication:
