Pages that link to "Item:Q5465986"
From MaRDI portal
The following pages link to GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM (Q5465986):
Displaying 30 items.
- \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
- Context-free pairs of groups. I: Context-free pairs and graphs (Q444402) (← links)
- Multipass automata and group word problems (Q495997) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Groups, the theory of ends, and context-free languages (Q792454) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- Non-finitely generated maximal subgroups of context-free monoids (Q2099288) (← links)
- Regular left-orders on groups (Q2102171) (← links)
- A language hierarchy of binary relations (Q2216121) (← links)
- Rational embeddings of hyperbolic groups (Q2233685) (← links)
- Groups with poly-context-free word problem. (Q2249563) (← links)
- The loop problem for Rees matrix semigroups. (Q2481325) (← links)
- The (nested) word problem (Q2630345) (← links)
- A dynamical definition of f.g. virtually free groups (Q2796981) (← links)
- Embeddings into Thompson's group \(V\) and \(\mathrm{co}\mathcal{C}{F}\) groups (Q2835337) (← links)
- Free products in R. Thompson's group \(V\). (Q2849037) (← links)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups (Q2975251) (← links)
- THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID (Q3112585) (← links)
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
- GROUPS WITH INDEXED CO-WORD PROBLEM (Q3421607) (← links)
- ON GROUPS AND COUNTER AUTOMATA (Q3601328) (← links)
- CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES (Q4923204) (← links)
- Some embeddings between symmetric R. thompson groups (Q5065431) (← links)
- Anisimov's Theorem for inverse semigroups (Q5246502) (← links)
- The co-word problem for the Higman-Thompson group is context-free (Q5297606) (← links)
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM (Q5322915) (← links)
- Finitely Generated Soluble Groups and Their Subgroups (Q5326257) (← links)
- Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)
- Normalish Amenable Subgroups of the R. Thompson Groups (Q6169901) (← links)
