Pages that link to "Item:Q5297606"

The following pages link to The co-word problem for the Higman-Thompson group is context-free (Q5297606):

Displaying 22 items.

• \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
• Context-free pairs of groups. I: Context-free pairs and graphs (Q444402) (← links)
• Monoids that map onto the Thompson-Higman groups (Q766116) (← links)
• Monoid generalizations of the Richard Thompson groups. (Q958127) (← links)
• Regular left-orders on groups (Q2102171) (← links)
• Rational embeddings of hyperbolic groups (Q2233685) (← links)
• Closure properties of knapsack semilinear groups (Q2236107) (← links)
• The word problem of the Brin-Thompson group is \textsf{coNP}-complete (Q2306657) (← links)
• Groups whose word problems are not semilinear (Q2317163) (← links)
• A dynamical definition of f.g. virtually free groups (Q2796981) (← links)
• Embeddings into Thompson's group <i>V</i> and coCF groups (Q2835337) (← links)
• Free products in R. Thompson’s group 𝑉 (Q2849037) (← links)
• Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups (Q2975251) (← links)
• Knapsack Problems for Wreath Products (Q3304131) (← links)
• CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES (Q4923204) (← links)
• Some embeddings between symmetric R. thompson groups (Q5065431) (← links)
• (Q5092480) (← links)
• Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)
• Knapsack in hyperbolic groups (Q5919299) (← links)
• Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)
• Groups of piecewise isometric permutations of lattice points, or Finitary rearrangements of tessellations (Q6134521) (← links)
• Normalish Amenable Subgroups of the R. Thompson Groups (Q6169901) (← links)