Groups with poly-context-free word problem.

DOI10.1515/gcc-2014-0002zbMath1306.20033arXiv1104.1806OpenAlexW3103968237MaRDI QIDQ2249563

Tara Brough

Publication date: 2 July 2014

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.1806

zbMATH Keywords

word problemmetabelian groupssemilinear setspoly-context-free languagesdirect products of free groupsintersections of context-free languagestorsion-free soluble groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Subgroup theorems; subgroup growth (20E07) Solvable groups, supersolvable groups (20F16) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

The (nested) word problem ⋮ Finitely Generated Soluble Groups and Their Subgroups ⋮ \(\mathcal C\)-graph automatic groups. ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ On a class of poly-context-free groups generated by automata ⋮ Multipass automata and group word problems ⋮ Groups whose word problems are not semilinear ⋮ Anisimov's Theorem for inverse semigroups ⋮ Non-finitely generated maximal subgroups of context-free monoids