FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)
From MaRDI portal
Publication:5559251
DOI10.1073/pnas.53.2.265zbMath0173.01401OpenAlexW2043468055WikidataQ36373644 ScholiaQ36373644MaRDI QIDQ5559251
Publication date: 1965
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.53.2.265
Related Items (7)
Computational processes, observers and Turing incompleteness ⋮ Gröbner-Shirshov bases, conformal algebras, and pseudo-algebras. ⋮ Friedberg splittings of recursively enumerable sets ⋮ Cayley automata ⋮ Degrees of unsolvability of the conjugacy problem for finitely-presented groups ⋮ Some undecidability results for non-monadic Church-Rosser Thue systems ⋮ Model-theoretic and algorithmic questions in group theory
This page was built for publication: FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)
