Non-finitely generated maximal subgroups of context-free monoids

被引:3
作者
Nyberg-Brodda, Carl-Fredrik [1 ]
机构
[1] Univ East Anglia, Sch Math, Norwich, England
关键词
Monoid; Maximal subgroup; Context -free group; Rewriting system; ONE-RELATOR GROUPS; SEMIGROUP; TORSION;
D O I
10.1016/j.jalgebra.2022.10.023
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A finitely generated group or monoid is said to be context-free if it has context-free word problem. In this note, we give an example of a context-free monoid, none of whose maximal subgroups are finitely generated. This answers a question of Brough, Cain & Pfeiffer on whether the group of units of a context-free monoid is always finitely generated, and highlights some of the contrasts between context-free monoids and context-free groups. Finally, we ask whether the group of units of a context-free monoid is always coherent.(c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页码:227 / 238
页数:12
相关论文
共 54 条
[1]  
Adian S. I., 1966, Proc. Steklov Inst. Math., V85
[2]  
Adian S.I., 1960, SOV MATH DOKL, V1, P1360
[3]  
ADIAN SI, 1960, DOKL AKAD NAUK SSSR+, V135, P1297
[4]  
Anisimov A., 1971, Kibernetika (Kyiv), V4, P18
[5]  
[Anonymous], 1979, Introduction to Automata Theory, Languages and Computation
[6]  
Baumslag Gilbert, 2019, GROUPS ST ANDREWS 20, V455, P119
[7]  
Book R.V., 1993, String-Rewriting Systems
[8]   MONADIC THUE SYSTEMS [J].
BOOK, RV ;
JANTZEN, M ;
WRATHALL, C .
THEORETICAL COMPUTER SCIENCE, 1982, 19 (03) :231-251
[9]   Context-Free Word Problem Semigroups [J].
Brough, Tara ;
Cain, Alan J. ;
Pfeiffer, Markus .
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2019, 2019, 11647 :292-305
[10]   Groups with poly-context-free word problem [J].
Brough, Tara .
GROUPS COMPLEXITY CRYPTOLOGY, 2014, 6 (01) :9-29