scientific article
From MaRDI portal
Publication:3659975
zbMath0514.20026MaRDI QIDQ3659975
Jürgen Avenhaus, Klaus Madlener
Publication date: 1980
Full work available at URL: https://eudml.org/doc/181690
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Free semigroups, generators and relations, word problems (20M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
Decidability and independence of conjugacy problems in finitely presented monoids, Efficient solution of some problems in free partially commutative monoids, On deciding the confluence of a finite string-rewriting system on a given congruence class, Implementation of the Nielsen algorithm in the algebraic programming system APS-1, A note on thue systems with a single defining relation, Square-free graphs are multiplicative, Confluence of one-rule Thue systems, Finite canonical rewriting systems for congruences generated by concurrency relations, Homomorphism Reconfiguration via Homotopy, The Nielsen reduction and P-complete problems in free groups, A note on special thue systems with a single defining relation, Complexity results on the conjugacy problem for monoids
