ON A GENERALIZATION OF DEHN'S ALGORITHM (Q3606403): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Unsolvable Problems About Small Cancellation and Word Hyperbolic Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growing context-sensitive languages and Church-Rosser languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of convergence groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Dehn's algorithm for word problems in groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups of polynomial growth and expanding maps. Appendix by Jacques Tits / rank
 
Normal rank
Property / cites work
 
Property / cites work: WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLVING THE WORD PROBLEM IN REAL TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic structures, rational growth, and geometrically finite hyperbolic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively hyperbolic groups: intrinsic geometry, algebraic properties, and algorithmic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine geometry over groups. I: Makanin-Razborov diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON CONTEXT-SENSITIVE LANGUAGES AND WORD PROBLEMS / rank
 
Normal rank

Revision as of 01:56, 29 June 2024

scientific article
Language Label Description Also known as
English
ON A GENERALIZATION OF DEHN'S ALGORITHM
scientific article

    Statements

    ON A GENERALIZATION OF DEHN'S ALGORITHM (English)
    0 references
    0 references
    0 references
    26 February 2009
    0 references
    word problem
    0 references
    rewriting systems
    0 references
    Dehn algorithm
    0 references
    finitely presented groups
    0 references
    Cannon algorithm
    0 references
    rewriting algorithms
    0 references
    semigroup generators
    0 references
    finitely generated nilpotent groups
    0 references
    relatively hyperbolic groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references