The co-word problem for the Higman-Thompson group is context-free (Q5297606): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1112/blms/bdl043 / rank
Normal rank
 
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.1112/blms/bdl043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077926207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness properties of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accessibility of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: GROUPS WITH INDEXED CO-WORD PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups, the theory of ends, and context-free languages / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1112/BLMS/BDL043 / rank
 
Normal rank

Latest revision as of 16:38, 30 December 2024

scientific article; zbMATH DE number 5170678
Language Label Description Also known as
English
The co-word problem for the Higman-Thompson group is context-free
scientific article; zbMATH DE number 5170678

    Statements

    The co-word problem for the Higman-Thompson group is context-free (English)
    0 references
    0 references
    0 references
    12 July 2007
    0 references
    co-word problem
    0 references
    finitely generated groups
    0 references
    context-free languages
    0 references
    Higman-Thompson groups
    0 references
    push-down automata
    0 references
    Houghton groups
    0 references

    Identifiers

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