An automatic sequence is an infinite sequence of terms characterized by a finite automaton. In other words, given an initial term in the sequence, the nth term can always be determined by applying a fixed and finite set of rules to the preceding n−1 terms. There are two equivalent definitions.
| Property | Value |
|---|
| dbpprop:abstract
|
- An automatic sequence is an infinite sequence of terms characterized by a finite automaton. In other words, given an initial term in the sequence, the nth term can always be determined by applying a fixed and finite set of rules to the preceding n−1 terms. There are two equivalent definitions.
|
| dbpprop:hasPhotoCollection
| |
| rdf:type
| |
| rdfs:comment
|
- An automatic sequence is an infinite sequence of terms characterized by a finite automaton. In other words, given an initial term in the sequence, the nth term can always be determined by applying a fixed and finite set of rules to the preceding n−1 terms. There are two equivalent definitions.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is owl:sameAs
of | |
![[RDF Data]](/statics/sw-cube.png)
