Poly-rational sequences are exactly the sequences of polynomially ambiguous weighted automata, of copyless cost-register automata, and of linear recurrences whose eigenvalues are roots of rational numbers.
Maximal partition logic: Towards a logical characterization of copyless cost register automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Robust Class of Linear Recurrence Sequences
Poly-rational sequences are exactly the sequences of polynomially ambiguous weighted automata, of copyless cost-register automata, and of linear recurrences whose eigenvalues are roots of rational numbers.