scientific article
From MaRDI portal
Publication:3867819
zbMath0431.03031MaRDI QIDQ3867819
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.
Free semigroups, generators and relations, word problems (20M05) Complexity of computation (including implicit computational complexity) (03D15) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80)
Related Items (2)
Equations with constraints on the solution in free groups ⋮ Model-theoretic and algorithmic questions in group theory
This page was built for publication:
