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

DOI10.1007/BF01225643MaRDI QIDQ1328439zbMATH OpenOpenAlexFDO

Authors Norbert Kuhn, Klaus Madlener, Friedrich Otto

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

presentationsfinitely generated subgroupsdecision problems\(\lambda\)-confluent string-rewriting systemsfinite confluent PCP2-presentationsfinitely generated context-free groupsfinitely presented polycyclic groupsprefix-rewriting systems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1263366
• scientific article; zbMATH DE number 1263406
• Prefix-rewriting on context-free groups
• The algorithmic theory of polycyclic-by-finite groups
• Groups with poly-context-free word problem.

Cites work

• scientific article; zbMATH DE number 3876579 (Why is no real title available?)
• scientific article; zbMATH DE number 3983496 (Why is no real title available?)
• scientific article; zbMATH DE number 176502 (Why is no real title available?)
• scientific article; zbMATH DE number 176741 (Why is no real title available?)
• scientific article; zbMATH DE number 177883 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 4127493 (Why is no real title available?)
• scientific article; zbMATH DE number 3224578 (Why is no real title available?)
• About the descriptive power of certain classes of finite string-rewriting systems
• Decidable Properties of Polycyclic Groups
• Decidable sentences of Church-Rosser congruences
• Groups and NTS languages
• Groups, the theory of ends, and context-free languages
• Monadic Thue systems
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• On deciding whether a monoid is a free monoid or is a group
• On weakly confluent monadic string-rewriting systems
• The algorithmic theory of polycyclic-by-finite groups

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328439)