K-synchronized sequence
In mathematics and theoretical computer science, a k-synchronized sequence is an infinite sequence of terms s(n) characterized by a finite automaton taking as input two strings m and n, each expressed in some fixed base k, and accepting if m = s(n). The class of k-synchronized sequences lies between the classes of k-automatic sequences and k-regular sequences.
Link from a Wikipage to another Wikipage
primaryTopic
K-synchronized sequence
In mathematics and theoretical computer science, a k-synchronized sequence is an infinite sequence of terms s(n) characterized by a finite automaton taking as input two strings m and n, each expressed in some fixed base k, and accepting if m = s(n). The class of k-synchronized sequences lies between the classes of k-automatic sequences and k-regular sequences.
has abstract
In mathematics and theoretical ...... ences and k-regular sequences.
@en
Link from a Wikipage to an external page
Wikipage page ID
53,807,843
page length (characters) of wiki page
Wikipage revision ID
930,237,864
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
type
comment
In mathematics and theoretical ...... ences and k-regular sequences.
@en
label
K-synchronized sequence
@en