Context-free irreducible word problems in groups.
From MaRDI portal
Publication:3442575
Recommendations
Cited in
(8)- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
- scientific article; zbMATH DE number 5155120 (Why is no real title available?)
- Groups with poly-context-free word problem.
- Developments in Language Theory
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
- Decidability of CPC-irreducibility of subshifts of finite type over free groups
- Groups with a Recursively Enumerable Irreducible Word Problem
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
This page was built for publication: Context-free irreducible word problems in groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3442575)