Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
28
0

Year Published

1996
1996
2016
2016

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 52 publications
(29 citation statements)
references
References 6 publications
0
28
0
Order By: Relevance
“…The three-folding sequence [45] is generated through the substitutions S(0) = 010, S(1) = 011. Starting with 0, after four steps one obtains: The sequence repeats itself if one keeps every third (underlined) term, which gives:…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The three-folding sequence [45] is generated through the substitutions S(0) = 010, S(1) = 011. Starting with 0, after four steps one obtains: The sequence repeats itself if one keeps every third (underlined) term, which gives:…”
Section: Discussionmentioning
confidence: 99%
“…Two other sequences will be considered in the following: the PF sequence [44] generated through substitutions on pairs of digits, which is studied in appendix A, and the TF sequence [45] studied in Appendix B.…”
Section: Introductionmentioning
confidence: 99%
“…In 4. FINITE STATE AUTOMATA This short section embeds the material of Sections 1 and 2 into the theory of rational languages [6,7] and automatic sequences [1,3,5]. DEFINITION 4.1.…”
Section: Slmentioning
confidence: 99%
“…= {01, 10, 11} C 3 = {000, 001, 011, 100, 110} C 4 = {0000, 0010, 0100, 0101, 0111, 1001, 1010, 1011, 1101, 1110, 1111} C 5 = {00001, 00010, 00011, 00101, 00110, 00111, 01000, 01010, 01100, 01101, 01111, 10000, 10001, 10011, 10100, 10110, 11000, 11001, 11011, 11100, 11110} The following result describes the cardinalities of the sets …”
mentioning
confidence: 99%
“…The k-automatic sequences are well-known and have been extensively studied since the 70's [2,5,7,14]. The construction of this kind of sequences is based on the representation of the integers in the base k. For a given integer n, one represents this number in base k using the greedy algorithm and obtains a word [n] k over the alphabet {0, .…”
Section: Introductionmentioning
confidence: 99%