scientific article
From MaRDI portal
Publication:3663518
zbMath0516.20018MaRDI QIDQ3663518
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite nilpotent groupsquasi-identitiesuniversal theorynonrecursive setsproblem 1.25 in Kourovka Notebook
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Finite nilpotent groups, (p)-groups (20D15)
Related Items (5)
Algorithmic problems for finite groups and finite \(0\)-simple semigroups ⋮ Minsky Machines and Algorithmic Problems ⋮ Algorithmically complex residually finite groups ⋮ The triviality problem for profinite completions ⋮ The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups
This page was built for publication:
