The co-word problem for the Higman-Thompson group is context-free (Q5297606): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 11:05, 26 June 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
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