Matches in DBpedia 2015-10 for { ?s ?p "An automatic sequence (or k-automatic sequence) is an infinite sequence of terms characterized by a finite automaton. The n-th term of the sequence is a mapping of the final state of the automaton when its input is the digits of n in some fixed base k. A k-automatic set is a set of non-negative integers for which the sequence of values of its characteristic function is an automatic sequence: that is, membership of n in the set can be determined by a finite state automaton on the digits of n in base k.An automaton reading the base k digits from the most significant is said to be direct reading, and from the least significant is reverse reading. However the two directions lead to the same class of sequences.Every automatic sequence is a morphic word."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Automatic_sequence abstract "An automatic sequence (or k-automatic sequence) is an infinite sequence of terms characterized by a finite automaton. The n-th term of the sequence is a mapping of the final state of the automaton when its input is the digits of n in some fixed base k. A k-automatic set is a set of non-negative integers for which the sequence of values of its characteristic function is an automatic sequence: that is, membership of n in the set can be determined by a finite state automaton on the digits of n in base k.An automaton reading the base k digits from the most significant is said to be direct reading, and from the least significant is reverse reading. However the two directions lead to the same class of sequences.Every automatic sequence is a morphic word.".