Non-finitely generated maximal subgroups of context-free monoids

DOI10.1016/j.jalgebra.2022.10.023OpenAlexW3183733731MaRDI QIDQ2099288

Carl-Fredrik Nyberg-Brodda

Publication date: 23 November 2022

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

rewriting systemmonoidmaximal subgroupcontext-free group

Mathematics Subject Classification ID

Combinatorics on words (68R15) Generators, relations, and presentations of groups (20F05) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

On the word problem for free products of semigroups and monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On properties not inherited by monoids from their Schützenberger groups.
• Generators and relations for subsemigroups via boundaries in Cayley graphs.
• Homological finiteness properties of monoids, their ideals and maximal subgroups.
• Groups, the theory of ends, and context-free languages
• Green index and finiteness conditions for semigroups.
• The accessibility of finitely presented groups
• Monadic Thue systems
• Finitely approximable regular semigroups
• Syntactic and Rees indices of subsemigroups
• Presentations for subgroups of monoids
• The word problem for one-relation monoids: a survey
• One-relator groups with torsion are coherent
• On the word problem for special monoids
• Groups with poly-context-free word problem.
• Groups whose word problems are not semilinear
• Context-free word problem semigroups
• The word problem in semi-groups with cancellation
• On theories with a combinatorial definition of 'equivalence'
• Amenability for discrete convolution semigroup algebras.
• DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP
• Word hyperbolic semigroups
• Semigroup and Group Presentations
• Applying rewriting methods to special monoids
• COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
• Some Remarks on Semigroup Presentations
• The Coherence of One-Relator Groups with Torsion and the Hanna Neumann Conjecture
• On one-relator groups and units of special one-relation inverse monoids
• On one-relator monoids and one-relator groups
• One-Relator Groups: An Overview

This page was built for publication: Non-finitely generated maximal subgroups of context-free monoids