On finitely generated submonoids of virtually free groups
From MaRDI portal
Publication:2317164
DOI10.1515/gcc-2018-0008zbMath1491.20081arXiv1712.07746OpenAlexW2803997585MaRDI QIDQ2317164
Publication date: 8 August 2019
Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.07746
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Groups, the theory of ends, and context-free languages
- Easy multiplications. II: Extensions of rational semigroups
- Topology of finite graphs
- Rational equivalence relations
- Easy multiplications. I: The realm of Kleene's theorem
- On commutative Kleene monoids
- A note on decidability questions on presentations of word semigroups
- Stallings foldings and subgroups of free groups
- The homomorphism problem for the free monoid
- On torsion-free groups with infinitely many ends
- On Cayley graphs of virtually free groups
- Context-Free Groups and Bass–Serre Theory
- Geometric characterizations of virtually free groups
- Subsemigroups of virtually free groups: finite Malcev presentations and testing for freeness
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
