Computing presentations for subgroups of polycyclic groups and of context-free groups

DOI10.1007/BF01225643zbMath0807.20030OpenAlexW2088619504MaRDI QIDQ1328439

Klaus Madlener, Friedrich Otto, Norbert Kuhn

Publication date: 29 August 1994

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01225643

zbMATH Keywords

presentationsdecision problemsfinitely generated subgroups\(\lambda\)-confluent string-rewriting systemsfinite confluent PCP2-presentationsfinitely generated context-free groupsfinitely presented polycyclic groupsprefix-rewriting systems

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

On the rational subsets of the free group ⋮ STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS ⋮ Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings

Cites Work

• Groups and NTS languages
• Decidable sentences of Church-Rosser congruences
• On weakly confluent monadic string-rewriting systems
• Groups, the theory of ends, and context-free languages
• About the descriptive power of certain classes of finite string-rewriting systems
• On deciding whether a monoid is a free monoid or is a group
• Monadic Thue systems
• The algorithmic theory of polycyclic-by-finite groups
• Decidable Properties of Polycyclic Groups
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing presentations for subgroups of polycyclic groups and of context-free groups