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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.
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.
-
On the Subspace Orbit Problem and the Simultaneous Skolem Problem
Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.