Prefix-rewriting on context-free groups

DOI10.1007/s002000050069zbMath0939.20030OpenAlexW2090884460MaRDI QIDQ1361015

Robert Cremanns

Publication date: 4 July 2000

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

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

zbMATH Keywords

finitely generated groupscontext-free groupsfinite complete presentationsprefix-rewriting systemsgeneralized word problemsKnuth-Bendix completionsvirtually free presentations

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) 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)

Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings

This page was built for publication: Prefix-rewriting on context-free groups