Closures of regular languages for profinite topologies.
From MaRDI portal
The Pin-Reutenauer iterative descriptive procedure to compute the closure in the free group of a regular language with respect to the Hall topology is shown to hold also for several pseudovarieties of finite semigroups: for the pseudovarieties of finite aperiodic semigroups, of finite semigroups in which all regular elements are idempotents, of finite \(\mathcal J\)-trivial semigroups, of finite local semilattices and of finite \(\mathcal R\)-trivial semigroups.
Recommendations
Cites work
- A Conjecture on the Hall Topology for the Free Group
- A constructive version of the Ribes-Zalesskiĭ product theorem.
- A NEW PROOF OF THE RHODES TYPE II CONJECTURE
- A SYNTACTICAL PROOF OF LOCALITY OF DA
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- APERIODIC POINTLIKES AND BEYOND
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- Complete reducibility of pseudovarieties.
- Complete reducibility of systems of equations with respect to \(\mathbf R\).
- COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
- Defining Relations and the Algebraic Structure of the Group SL2 over Integral Hamilton Quaternions
- Extending partial automorphisms and the profinite topology on free groups
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3504469 (Why is no real title available?)
- scientific article; zbMATH DE number 1944113 (Why is no real title available?)
- scientific article; zbMATH DE number 1419247 (Why is no real title available?)
- scientific article; zbMATH DE number 1416098 (Why is no real title available?)
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Iterated periodicity over finite aperiodic semigroups
- McCammond’s normal forms for free aperiodic semigroups revisited
- NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
- On algorithmic problems for joins of pseudovarieties
- On Pointlike Sets and Joins of Pseudovarieties
- On some systems of equations with constraints in a free group. -- Addenda.
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- On The Profinite Topology on a Free Group
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Profinite semigroups and applications.
- Some algorithmic problems for pseudovarieties
- The \(\mathfrak q\)-theory of finite semigroups.
- The word problem for \(\omega \)-terms over DA
- Theorems on Compact Totally Disconnected Semigroups and Lattices
- Topologies for the free monoid
Cited in
(8)- Polynomial closure of group languages and open sets of the Hall topology
- Profinite topologies
- Recognizing pro-\(\mathrm{R}\) closures of regular languages
- McCammond’s normal forms for free aperiodic semigroups revisited
- Factoriality and the Pin-Reutenauer procedure
- scientific article; zbMATH DE number 1740161 (Why is no real title available?)
- POLYNOMIAL CLOSURE AND TOPOLOGY
- On the complexity of computing the profinite closure of a rational language
This page was built for publication: Closures of regular languages for profinite topologies.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467504)
