scientific article; zbMATH DE number 2074997

MaRDI QIDQ4469472zbMATH OpenFDO

Authors Deko V. Dekov

Publication date 15 June 2004

zbMATH Keywords

complete rewriting systemsgroupsnormal formssemigroupsuniversal algebrasword problem

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Recommendations

• Finite complete rewriting systems for groups
• Finite complete rewriting systems for regular semigroups.
• Rewriting systems of Coxeter groups
• Finite complete rewriting systems and the complexity of word problem
• Geodesic rewriting systems and pregroups

Cited in

(17)

• Finite complete rewriting systems and finite derivation type for small extensions of monoids
• Rewriting systems of Coxeter groups
• Rewriting in varieties of idempotent semigroups
• scientific article; zbMATH DE number 3871338 (Why is no real title available?)
• scientific article; zbMATH DE number 5778575 (Why is no real title available?)
• Rewriting Systems and Embedding of Monoids in Groups
• On finite complete rewriting systems and large subsemigroups.
• Soluble groups with a finite rewriting system
• Finite complete rewriting systems for groups
• Subgroups of finite index in groups with finite complete rewriting systems
• Complete rewriting system for the Schützenberger product of n groups
• Rewriting system of certain semigroups with three generators
• Finite complete rewriting systems for regular semigroups.
• The Knuth-Bendix algorithm and the conjugacy problem in monoids.
• Rewrite systems for varieties of semigroups
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• Finite complete rewriting systems and the complexity of word problem

This page was built for publication:

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