Automatic sequence

Automatic sequence

In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton. The n-th term of an automatic sequence a(n) is a mapping of the final state reached in a finite automaton accepting the digits of the number n in some fixed base k.
school
http://dbpedia.org/resource/Automatic_sequence
Automatic_sequence
primaryTopic

Automatic sequence

In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton. The n-th term of an automatic sequence a(n) is a mapping of the final state reached in a finite automaton accepting the digits of the number n in some fixed base k.
school
http://dbpedia.org/resource/Automatic_sequence
has abstract
En mathématique, en combinatoi ...... ., est un nombre transcendant.
@fr
In mathematics and theoretical ...... n) = 1 if n S and 0 otherwise.
@en
Uma sequência automática (ou k ...... a sequência automática é uma .
@pt
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
En mathématique, en combinatoi ...... a suite de Prouhet-Thue-Morse.
@fr
In mathematics and theoretical ...... number n in some fixed base k.
@en
Uma sequência automática (ou k ...... a sequência automática é uma .
@pt
label
Automatic sequence
@en
Sequência automática
@pt
Suite automatique
@fr
sameAs
wasDerivedFrom
isPrimaryTopicOf