Profinite semigroups and applications.
From MaRDI portal
Publication:3365833
zbMATH Open1109.20050MaRDI QIDQ3365833FDOQ3365833
Authors: Jorge Almeida 
Publication date: 13 February 2006
Recommendations
regular languagesrational languagespseudoidentitiespseudovarieties of finite semigroupsimplicit operationsrelatively free profinite semigroupstame pseudovarieties
Limits, profinite groups (20E18) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (43)
- Iterated periodicity over finite aperiodic semigroups
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- PROFINITE METHODS IN SEMIGROUP THEORY
- Towards a pseudoequational proof theory
- A geometric interpretation of the Schützenberger group of a minimal subshift
- Bases for pseudovarieties closed under bideterministic product
- Theme and variations on the concatenation product
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
- The palindromization map
- On non-commuting sets in finite soluble CC-groups.
- Dual Space of a Lattice as the Completion of a Pervin Space
- Reducibility vs. definability for pseudovarieties of semigroups
- On the power pseudovariety \(\mathbf{PCS}\).
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
- On uniformly continuous functions for some profinite topologies
- Profinite semigroups and symbolic dynamics
- Some reducibility properties for pseudovarieties of the form \(DRH\)
- Weak separation problem for tree languages
- Pointlike sets with respect to R and J.
- The \(\kappa\)-word problem over \(\mathsf{DRH}\)
- Stone pseudovarieties
- Substitution Principle and semidirect products
- Closures of regular languages for profinite topologies.
- Equidivisibility and profinite coproduct
- The rank of variants of nilpotent pseudovarieties
- Pseudovarieties of ordered completely regular semigroups
- Complete κ-reducibility of pseudovarieties of the form DRH
- Stone duality, topological algebra, and recognition.
- On the group of a rational maximal bifix code
- What makes a Stone topological algebra profinite
- Duality and Equational Theory of Regular Languages
- Recognizing pro-\(\mathrm{R}\) closures of regular languages
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- On decidability of intermediate levels of concatenation hierarchies
- Profinite topologies
- Subsemigroup, ideal and congruence growth of free semigroups
- On the irreducibility of pseudovarieties of semigroups.
- Title not available (Why is that?)
- On the endomorphism monoid of a profinite semigroup
- Title not available (Why is that?)
- Freeness of Schützenberger groups of primitive substitutions
- A profinite approach to complete bifix decodings of recurrent languages
- Profinite techniques for probabilistic automata and the Markov monoid algorithm
This page was built for publication: Profinite semigroups and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3365833)
