Deterministic concatenation product of languages recognized by finite idempotent monoids. (Q2373421): Difference between revisions

Let \(A\) be a finite alphabet. If \(a\) is a letter in \(A\) and \(L_0,L_1\) are languages over \(A\), then the concatenation product \(L_0aL_1\) is the set \(\{u_0au_1\mid u_0\in L_0\) and \(u_1\in L_1\}\). This product is called `left deterministic' (respectively, `right deterministic') if each of its elements has a unique prefix (respectively, suffix) in \(L_0a\) (respectively, \(aL_1\)). It is `bideterministic' in case it is both left and right deterministic. Given a variety of languages \(\mathcal V\) and the corresponding variety of finite monoids \(\mathbf V\), the author considers the variety of finite monoids \(\mathbf V_{ld}\) (respectively, \(\mathbf V_{rd}\), \(\mathbf V_{bd}\)) associated with the smallest variety of languages containing \(\mathcal V\) and the left deterministic (respectively, right deterministic, bideterministic) products of languages of \(\mathcal V\). The author gives a description, in terms of finite bases of identities, of \(\mathbf V_{bd}\) when \(\mathbf V\) is any variety of finite idempotent monoids and of \(\mathbf V_{ld}\), and dually of \(\mathbf V_{rd}\), for an infinite number of varieties \(\mathbf V\) of finite idempotent monoids. The author also gives a description of varieties of finite ordered monoids corresponding to the left, right and bideterministic products.