Groups whose word problems are not semilinear-Reference-Cited by-同舟云学术

Groups whose word problems are not semilinear

Published:2018-11-01 Issue:2 Volume:10 Page:53-62
ISSN:1867-1144
Container-title:Groups Complexity Cryptology
language:
Short-container-title:

Author:

Gilman Robert H.¹,Kropholler Robert P.²,Schleimer Saul³

Affiliation:

1. Department of Mathematics, Stevens Institute of Technology, HobokenNJ 07030, USA

2. Department of Mathematics, Tufts University, MedfordMA 02135, USA

3. Mathematics Institute, University of Warwick, Coventry, United Kingdom

Abstract

AbstractSuppose that G is a finitely generated group and

{\operatorname{WP}(G)}

is the formal language of words defining the identity in G. We prove that if G is a virtually nilpotent group that is not virtually abelian, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled Artin group whose graph lies in a certain infinite class, then

{\operatorname{WP}(G)}

is not a multiple context-free language.

Funder

National Science Foundation

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Computer Networks and Communications

Link

https://www.degruyter.com/downloadpdf/journals/gcc/10/2/article-p53.xml

Reference76 articles.

1. Formal languages: An introduction and a synopsis;Handbook of Formal Languages. Vol. 1,1997

2. A context-free and a 1-counter geodesic language for a Baumslag–Solitar group;Theoret. Comput. Sci.,2005

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the word problem for free products of semigroups and monoids;Journal of Algebra;2023-05

2. Non-finitely generated maximal subgroups of context-free monoids;Journal of Algebra;2023-02

3. Groups Whose Word Problems Are Accepted by Abelian $$G$$-Automata;Developments in Language Theory;2023

4. Parallel Hyperedge Replacement String Languages;Electronic Proceedings in Theoretical Computer Science;2021-02-08

5. Closure properties in the class of multiple context-free groups;Groups Complexity Cryptology;2019-05-01