THE WORD PROBLEM
From MaRDI portal
Publication:3259071
DOI10.1073/pnas.44.10.1061zbMath0086.24701OpenAlexW2007166036WikidataQ37618809 ScholiaQ37618809MaRDI QIDQ3259071
Publication date: 1958
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.44.10.1061
Related Items
Følner functions and the generic word problem for finitely generated amenable groups ⋮ Partial word and equality problems and Banach densities ⋮ The word problem for some uncountable groups given by countable words ⋮ Levels of undecidability in rewriting ⋮ The classification of surfaces via normal curves ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Computer proof of monotonicity of operations on orthomodular lattices ⋮ A notion of effectiveness for subshifts on finitely generated groups ⋮ The B B Newman spelling theorem ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Constructive geometrization of Thurston maps and decidability of Thurston equivalence ⋮ Real computational universality: the word problem for a class of groups with infinite presentation ⋮ A generalization of a power-conjugacy problem in torsion-free negatively curved groups ⋮ Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$ ⋮ Conjugacy search problem and the Andrews-Curtis conjecture ⋮ Search problems in groups and branching processes ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Well-orders realized by C.E. equivalence relations ⋮ Model-theoretic and algorithmic questions in group theory ⋮ MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies ⋮ On one-relator groups and units of special one-relation inverse monoids
