Recognizable languages in free many-sorted algebras are regular under finitary assumptions.
With appendices by the author, Bjarni J´ onsson, Walter Taylor, Robert W
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Kleene theorem for free many-sorted algebras
Recognizable languages in free many-sorted algebras are regular under finitary assumptions.