Relative rewriting systems.

DOI10.1142/9789812702616_0011MaRDI QIDQ3552226zbMATH OpenOpenAlexFDO

Authors Jing Wang, Stephen J. Pride

Publication date 14 April 2010

Published in Semigroups and Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789812702616_0011

zbMATH Keywords

finiteness conditionsfinite derivation typerelative presentationsfinitely generated monoidsfinite homological typefinite rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Connections of semigroups with homological algebra and category theory (20M50) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• On higher order homological finiteness of rewriting systems.
• scientific article; zbMATH DE number 5218144
• For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
• scientific article; zbMATH DE number 1419256
• Finite derivation type implies the homological finiteness condition \(FP_ 3\)

This page was built for publication: Relative rewriting systems.

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