Context-free irreducible word problems in groups.

zbMATH Open1133.20019MaRDI QIDQ3442575FDOQ3442575

Authors Ana R. Fonseca, Richard M. Thomas 

Publication date 18 May 2007

zbMATH Keywords

Cayley graphscontext-free languagesregular languagesrecursive languagesirreducible word probleminsertion basesinsertion closed languagesinsertion closures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• scientific article; zbMATH DE number 5155120
• GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
• On a subclass of context-free groups
• Developments in Language Theory
• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language

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)