
Generalized Lyndon Factorizations of Infinite Words
A generalized lexicographic order on words is a lexicographic order wher...
read it

A note on banded linear systems
In [2] a new factorization for infinite Hessenberg banded matrices was i...
read it

On simplification of DualYoula approach for closedloop identification
The dual Youla method for closed loop identification is known to have se...
read it

Finite and infinite closedrich words
A word is called closed if it has a prefix which is also its suffix and ...
read it

Streaming Transformations of Infinite OrderedData Words
In this paper, we define streaming register transducer (SRT), a oneway,...
read it

Generalized infinite factorization models
Factorization models express a statistical object of interest in terms o...
read it

On generalized Lyndon words
A generalized lexicographical order on infinite words is defined by choo...
read it
Closed ZivLempel factorization of the mbonacci words
A word w is said to be closed if it has a proper factor x which occurs exactly twice in w, as a prefix and as a suffix of w. Based on the concept of ZivLempel factorization, we define the closed zfactorization of finite and infinite words. Then we find the closed zfactorization of the infinite mbonacci words for all m ≥ 2. We also classify closed prefixes of the infinite mbonacci words.
READ FULL TEXT
Comments
There are no comments yet.