Graph groups are biautomatic (Q1331906): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-4049(94)90015-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972761586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic groups and amalgams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of graph groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small cancellation theory and automatic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and geometry for graph products of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5513066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On theories with a combinatorial definition of 'equivalence' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface Subgroups of Graph Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word problems and a homological finiteness condition for monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem for free partially commutative groups / rank
 
Normal rank

Latest revision as of 16:30, 22 May 2024

scientific article
Language Label Description Also known as
English
Graph groups are biautomatic
scientific article

    Statements

    Graph groups are biautomatic (English)
    0 references
    0 references
    9 May 1995
    0 references
    commuting clique
    0 references
    presentation
    0 references
    relation
    0 references
    generators
    0 references
    graph groups
    0 references
    free groups
    0 references
    bicombable
    0 references
    normal forms
    0 references
    combings
    0 references
    regular language
    0 references
    free monoid
    0 references
    biautomatic
    0 references

    Identifiers

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