No label defined (Q3697247)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3920804
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3920804

      Statements

      0 references
      1985
      0 references
      free monoid
      0 references
      initial topology
      0 references
      recognizable language
      0 references
      adherence
      0 references
      membership problem
      0 references
      pseudo-variety
      0 references
      finite inverse monoids
      0 references
      [For the entire collection see Zbl 0563.00018.] Let \(A^*\) be a free monoid and \(\mathcal C\) (resp. \(\mathcal C_ p)\) be the initial topology defined by all morphisms of \(A^*\) into a finite group (resp. \(p\)-group). The set of open subsets of \(A^*\) is closed under usual language-theoretic operations. Any surjective length-preserving morphism between two free monoids is open. Two questions arise: 1. Is it decidable whether a recognizable language is open or closed? 2. Is the adherence of a recognizable language effectively computable? In particular, is it recognizable? It is shown that a positive answer would allow to compute the kernel of a finite semigroup, and solve the membership problem for the pseudo-variety generated by the finite inverse monoids.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references