A complete decidable characterization of polynomial rules P yielding bilinear associative commutative P-products on series is given, together with decidability of equivalence for the associated P-automata.
2011.The Concrete Tetrahedron: Sym- bolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Commutative algebras of series
A complete decidable characterization of polynomial rules P yielding bilinear associative commutative P-products on series is given, together with decidability of equivalence for the associated P-automata.