About: K-synchronized sequence

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property Value
dbo:abstract
  • 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. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 53807843 (xsd:integer)
dbo:wikiPageLength
  • 5316 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1032248144 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • 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. (en)
rdfs:label
  • K-synchronized sequence (en)
owl:differentFrom
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License