Finite complete Rewriting systems and biautomatic structures for Stylic monoids

We construct finite complete rewriting systems and biautomatic structures for Stylic monoids of finite rank. We further show that every Stylic monoid of finite rank has finite derivation type and satisfies the homological conditions left and right [Formula: see text].