scientific article
From MaRDI portal
Publication:3998014
zbMath0719.03019MaRDI QIDQ3998014
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)
Related Items (21)
On termination of confluent one-rule string-rewriting systems ⋮ Simple termination is difficult ⋮ More problems in rewriting ⋮ On the termination problem for one-rule semi-Thue system ⋮ Termination of string rewriting proved automatically ⋮ Termination proofs for string rewriting systems via inverse match-bounds ⋮ Left-divisibility and word problems in single relation monoids ⋮ One-rule trace-rewriting systems and confluence ⋮ Confluence of one-rule Thue systems ⋮ Deciding Innermost Loops ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ The word problem for one-relation monoids: a survey ⋮ Match-bounded string rewriting systems ⋮ Simple termination is difficult ⋮ Termination and derivational complexity of confluent one-rule string-rewriting systems ⋮ Loops under Strategies ⋮ Non-Looping String Rewriting ⋮ On normalizing, non-terminating one-rule string rewriting systems ⋮ On prefixal one-rule string rewrite systems ⋮ One-rule semi-Thue systems with loops of length one, two or three
This page was built for publication:
