activity
20162022
most citedCompletely Reachable Automata

3 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing math.GRShow all

8 papers · 1 filter

math.GR2022

Remark on the identities of the grammic monoid with three generators

Mikhail V. Volkov

Grammic monoids have recently been introduced by Christian Choffrut in terms of the action of the free monoid over a fixed ordered alphabet on the set of rows of Young tableaux…

math.GR2020

Block-groups and Hall relations

Azza M. Gaysin, Mikhail V. Volkov

A binary relation on a finite set is called a Hall relation if it contains a permutation of the set. Under the usual relational product, Hall relations form a semigroup which is kn…

math.GR2019

Identities in Brandt semigroups, revisited

Mikhail V. Volkov

We present a new proof for the main claim made in the author's paper "On the identity bases of Brandt semigroups" (Ural. Gos. Univ. Mat. Zap. 14, no.1 (1985), 38--42); this claim p…

math.GR2019

The identities of the free product of a pair of two-element monoids

Mikhail Volkov

Up to isomorphism, there exist two non-isomorphic two-element monoids. We show that the identities of the free product of every pair of such monoids admit no finite basis.

math.GR2019

Identities of the Kauffman Monoid

Yuzhu Chen, Xun Hu, N. V. Kitov +2

We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid . Our characterization leads to a polynomial time algorithm t…

math.GR2018

Inductive groupoids and cross-connections of regular semigroups

P. A. Azeef Muhammed, M. V. Volkov

There are two major structure theorems for an arbitrary regular semigroup using categories, both due to Nambooripad. The first construction using inductive groupoids departs from t…