Positive varieties of regular lattice languages are in bijection with pseudo-varieties of finite ordered monoids, generalizing Pin's positive variety theorem.
Springer Science & Business Media, 2009
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Positive Varieties of Lattice Languages
Positive varieties of regular lattice languages are in bijection with pseudo-varieties of finite ordered monoids, generalizing Pin's positive variety theorem.