Talk:Constant-recursive sequence: Difference between revisions

Content deleted Content added
rate class=B (all criteria and comments addressed)
No edit summary
Line 138:
=== GA criteria list ===
 
{| class="wikitable" align="left"
|0||{{Wikipedia:Good article criteria/GAC|0}}
|-
Line 151:
|0e||{{Wikipedia:Good article criteria/GAC|0e}}
|}
{| class="wikitable" align="left"
|1||{{Wikipedia:Good article criteria/GAC|1}}
|-
Line 184:
|6b||{{Wikipedia:Good article criteria/GAC|6b}}
|}
 
== Semiring ==
 
The article includes the sentence "any function accepted by a weighted automaton over the unary alphabet <math>\Sigma = \{a\}</math> over the semiring <math>(\mathbb{R}, +, \times)</math> is constant-recursive", but it feels odd to write "the semiring <math>(\mathbb{R}, +, \times)</math>" when <math>(\mathbb{R}, +, \times)</math> is in fact a field. Therefore I would suggest expanding upon the sentence as
 
: "any function accepted by a weighted automaton over the unary alphabet <math>\Sigma = \{a\}</math> over the semiring <math>(\mathbb{R}, +, \times)</math> (which is in fact a ring, and even a field) is constant-recursive."
 
If nobody opposes this change then please reply to this saying so, and I will make the change and delete this thread so that the To-do list for Good Article status can remain the most recent item on the Talk page :) [[User:Joel Brennan|Joel Brennan]] ([[User talk:Joel Brennan|talk]]) 20:11, 18 January 2023 (UTC)