Pages that link to "Item:Q2249563"
From MaRDI portal
The following pages link to Groups with poly-context-free word problem. (Q2249563):
Displaying 17 items.
- \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
- Multipass automata and group word problems (Q495997) (← links)
- Groups, the theory of ends, and context-free languages (Q792454) (← links)
- Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
- Prefix-rewriting on context-free groups (Q1361015) (← links)
- Non-finitely generated maximal subgroups of context-free monoids (Q2099288) (← links)
- Groups whose word problems are not semilinear (Q2317163) (← links)
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
- The (nested) word problem (Q2630345) (← links)
- On a class of poly-context-free groups generated by automata (Q2700958) (← links)
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
- (Q3442618) (← links)
- On a subclass of context-free groups (Q3978768) (← links)
- Anisimov's Theorem for inverse semigroups (Q5246502) (← links)
- Finitely Generated Soluble Groups and Their Subgroups (Q5326257) (← links)
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM (Q5465986) (← links)
- Free products of semigroups and monoids with a deterministic context-free word problem (Q6663534) (← links)
