scientific article; zbMATH DE number 3920804

From MaRDI portal
Publication:3697247





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3697247)