Answers are grounded in this paper and cite their sources.
We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where (non)expressiveness results translate to class separations. A typical example of a polynomial recursive sequence is bn = n!. Our main result is that the sequence un = nn is not polynomial recursive.
No takes yet. Share an insight, caveat, or question.
Cadilhac et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: