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 definition of a family of automata
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2years
2026 2representative 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.
- Representing One Letter Weighted Automata Over the Tropical Semiring