Questions tagged [word-problem]

Let $G$ be a f.g. nilpotent group. I wanted to know if the order problem (given $g \in G$, deciding if there exists $n$ s.t. $g^n=e$) is decidable in $G$? In such a group, the word problem is ...

There is a solution to the word problem for finitely presented (non-bounded) lattices, as well as a solution to the word problem for free bounded lattices. I am assuming that there is a solution to ...

Recall from 1 that a cofibration of strict ω-categories is a retract of relative $I$-cell complexes, where $I$ denotes the set of boundary inclusions $\partial D^n \hookrightarrow D^n$, where $D_n$ ...

The occurrence problem asks if, given a group $G$ and a subgroup $H$ of $G$, there exists an algorithm to decide whether $x\in G$ belongs to $H$. Let $G$ be a group that has solvable word problem. Is ...