On the power pseudovariety PCS
classification
🧮 math.GR
keywords
mathbfpowerpseudovarietyalgorithmscharacterizationsdecidingleadsmembers
read the original abstract
Some new semantic and syntactic characterizations of the members of the power pseudovariety $\mathbf{PCS}$ are obtained. This leads in particular to new algorithms for deciding membership in $\mathbf{PCS}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.