The word problem
From MaRDI portal
Cited in
(58)- Model-theoretic and algorithmic questions in group theory
- Ends of groups with the integers as quotient
- Unsolvable algorithmic problems for semigroups, groups and rings
- On the emptiness of the intersection of two DOS languages problem
- Combinatorial distance between HNN decompositions of a group
- Groups with relative standard basis
- Universal group with twenty-one defining relations
- On the computability of conjugate powers in finitely generated Fuchsian groups
- Mayer-Vietoris sequences for HNN-groups and homological duality
- HNN extensions of semigroups
- Random walks on Baumslag-Solitar groups
- Certain residual properties of generalized Baumslag-Solitar groups
- Willis theory via graphs
- The isomorphism problem for residually torsion-free nilpotent groups.
- Gröbner-Shirshov bases, conformal algebras, and pseudo-algebras.
- Recursively enumerable degress and the conjugacy problem
- A new non-Hopf group
- On recognising Hopf groups
- On recognising properties of groups which have solvable word problem
- Quotient groups of the multiplicative semigroups of certain rings. II
- Small cancellation theory over free products with amalgamation
- On the complexity of reduction algorithms in Novikov-Boone constructions
- On the complexity of the identity problem for finitely defined groups
- Simple examples of groups with unsolvable word problem
- Degrees of unsolvability of the conjugacy problem for finitely-presented groups
- Representation of Turing reducibility by word and conjugacy problems in finitely presented groups
- On the group property recognition problem
- The conjugacy problem for a free product with amalgamation
- Gröbner-Shirshov bases for some one-relator groups.
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems
- scientific article; zbMATH DE number 5560346 (Why is no real title available?)
- Efficient Computation in Groups and Simplicial Complexes
- The word problem and the isomorphism problem for groups
- An algebraic characterization of groups with soluble word problem
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable.
- On the Generation of One-Relator Groups
- On small cancellation theory over H.N.N. extensions
- The word problem for division rings
- On one relator groups and HNN extensions
- Abstract commensurators of surface groups
- Baumslag-Solitar groups, relative profinite completions and measure equivalence rigidity
- A finitely presented group with almost solvable conjugacy problem.
- Some completely semisimple HNN-extensions of inverse semigroups
- Search problems in groups and branching processes.
- A solution to the donkey sentence problem
- The Word Problem for Pride Groups
- Computability Theory and Differential Geometry
- Complexity of word problems for HNN-extensions
- Complexity of word problems for HNN-extensions
- Parallel algorithms for power circuits and the word problem of the Baumslag group
- Improved parallel algorithms for generalized Baumslag groups
- Finitely presented condensed groups
- Certain residual properties of HNN-extensions with normal associated subgroups
- Class-preserving automorphisms of descending HNN extensions of abelian groups
- HNN extensions and embedding theorems for groups
- Girth alternative for HNN extensions
- The root-class residuality of the fundamental groups of graphs of groups
This page was built for publication: The word problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925116)