: Infinite words on a finite non-empty alphabet have been investigated in various respects. We will consider here two important strategies in approaching such words; one of them pr...
The stabilizer of an infinite word w over a finite alphabet is the monoid of morphisms over that fix w. In this paper we study various problems related to stabilizers and their g...
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...