Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Wai-Fong Chuan"'
Autor:
Wai-Fong Chuan, Fang-Yi Liao
Publikováno v:
Discrete Applied Mathematics. 217:243-260
Let α be an irrational number between 0 and 1 with continued fraction expansion 0 ; a 1 + 1 , a 2 , a 3 , ź , where a n ź 1 ( n ź 1 ). Define a sequence of numbers { q n } n ź - 1 by q - 1 = 1 , q 0 = 1 , q n = a n q n - 1 + q n - 2 ( n ź 1 ).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::656c6ba177f5168a6e4e7bbb39c089b3
https://doi.org/10.1016/j.dam.2016.07.024
https://doi.org/10.1016/j.dam.2016.07.024
Publikováno v:
Discrete Applied Mathematics. 214:63-87
We prove that all suffixes of a two-way infinite extension of an irrational characteristic word can be represented as Markov word patterns (MWPs) of type 1 and under some conditions, as MWPs of type 2. For each of these MWPs, the pairs of seed words
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::515fa5afc639c56f1606e90e62409bfd
https://doi.org/10.1016/j.dam.2016.05.032
https://doi.org/10.1016/j.dam.2016.05.032
Autor:
Yu-Jau Lin, Wai-fong Chuan
Publikováno v:
Discrete Mathematics. 343:111746
The Bernoulli word B ( ξ ) of an irrational number ξ is an infinite word over the alphabet { a , b } , in which the n th letter is a if [ ( n + 1 ) ξ + 1 2 ] − [ n ξ + 1 2 ] = 0 and is b if [ ( n + 1 ) ξ + 1 2 ] − [ n ξ + 1 2 ] = 1 ( n ≥
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afa0baed1b63c2d1b5f5f96eeb4a8ae3
https://doi.org/10.1016/j.disc.2019.111746
https://doi.org/10.1016/j.disc.2019.111746
Autor:
Fang-Yi Liao, Wai-Fong Chuan
Publikováno v:
Discrete Applied Mathematics. 166:71-83
For each suffix X of a two-way infinite Fibonacci word, we consider the factorization X = u k u k + 1 u k + 2 ? , where k is a positive integer, and the length of the factor u i is the i th Fibonacci number ( i ? k ) . It is called the Fibonacci fact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::906bc428ccabdf6e25ba7bca7afce89c
https://doi.org/10.1016/j.dam.2013.09.027
https://doi.org/10.1016/j.dam.2013.09.027
Autor:
Hui-Ling Ho, Wai-Fong Chuan
Publikováno v:
Theoretical Computer Science. :39-51
Let α be an irrational number with 0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8be5da332f5f080e202ed68a9712405c
https://doi.org/10.1016/j.tcs.2012.04.015
https://doi.org/10.1016/j.tcs.2012.04.015
Publikováno v:
Theoretical Computer Science. 412:876-891
Let @a=(a"1,a"2,...) be a sequence (finite or infinite) of integers with a"1>=0 and a"n>=1, for all n>=2. Let {a,b} be an alphabet. For n>=1, and r=r"1r"2...r"n@?N^n, with 0@?r"i@?a"i for 1@?i@?n, there corresponds an nth-order @a-word u"n[r] with la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84add338af372b51728069d96aef3908
https://doi.org/10.1016/j.tcs.2010.11.038
https://doi.org/10.1016/j.tcs.2010.11.038
Autor:
Wai-Fong Chuan, Hui-Ling Ho
Publikováno v:
Theoretical Computer Science. 349(3):429-442
Let τ = (√5 - 1)/2. Let a, b be two distinct letters. The infinite Fibonacci word is the infinite word G = babbababbabbababbababbabba... whose nth letter is a (resp., b) if [(n + 1)τ] - [nτ] = 0 (resp., 1). For a factor w of G, the location of w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4483ed4cd9d8ccbf57ec0c20d27f9c53
Autor:
Wai-Fong Chuan
Publikováno v:
Theoretical Computer Science. 337:169-182
Let β be an irrational number between 0 and 1. The characteristic word f(β) of β is defined to be the infinite word over {0, 1} whose nth letter is [(n + 1)β] -[nβ], n ≥ 1. It is well known that, for each m ≥ 1, f(β) has exactly m + 1 disti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d9732c6405a9a5dd87a66d06bc40ca1
https://doi.org/10.1016/j.tcs.2004.12.028
https://doi.org/10.1016/j.tcs.2004.12.028
Autor:
Wai-Fong Chuan
Publikováno v:
Theoretical Computer Science. 310(1-3):273-285
For each nonempty binary word w = c1c2...Cq, where ci ∈ {0, 1}, the nonnegative integer Σi=1q (q + 1 - i)ci is called the moment of w and is denoted by M(w). Let [w] denote the conjugacy class of w. Define M([w]) = {M(u): u ∈ [w]}, N(w) = {M(u)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01e5779a402e388853b5dda7f0575b38