Decidability of finite quasivarieties generated by certain transformation semigroups. (Q1771861)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decidability of finite quasivarieties generated by certain transformation semigroups.
scientific article

    Statements

    Decidability of finite quasivarieties generated by certain transformation semigroups. (English)
    0 references
    0 references
    19 April 2005
    0 references
    Given a class \(\mathcal C\) of finite semigroups, the least pseudovariety containing \(\mathcal C\) is known to be \({\mathbb H \mathbb S \mathbb P}_{\text{fin}} ({\mathcal C})\). Many famous open problems about formal languages and formal automata lead to the pseudovariety membership problem (PMP): given an effectively described class \(\mathcal C\) of finite semigroups, can the pseudovariety \({\mathbb H \mathbb S \mathbb P}_{\text{fin}} ({\mathcal C})\) be effectively described? A similar problem for the least finite quasivariety \({\mathbb S \mathbb P}_{\text{fin}} ({\mathcal C})\) containing the class \(\mathcal C\), the so-called quasivariety membership problem (QMP), can be formulated analogously. It is known that the answer to some instances of the PMP or QMP is negative. The aim of the paper is to establish a fairly general property of a class \(\mathcal C\) of finite transformation semigroups which ensures that the answer to the QMP is affirmative. This property holds for example for the class of semigroups of total (or partial, or partial injective) order preserving (or decreasing, or decreasing and order-preserving) transformations of a finite chain.
    0 references
    pseudovariety
    0 references
    quasivariety
    0 references
    transformation semigroup
    0 references
    algorithmic decidability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references