Jan 1, 2007 · We investigate binary words and languages having a balanced structure of (scattered) subwords. We introduce a "difference function" D for ...

We investigate binary words and languages having a balanced structure of (scattered) subwords. We introduce a ”difference function“ D for binary words. For D = ...

Oct 22, 2024 · We investigate binary words and languages having a balanced structure of (scattered) subwords. We introduce a "difference function" D for ...

We investigate binary words and languages having a balanced structure of (scattered) subwords. We introduce a "difference function" D for binary words.

This work compares the numbers of occurrences of ab and ba as (scattered) subwords by introducing a 'difference function' and investigates binary words and ...

Nov 6, 2008 · Arithmetical combinations of such quantities yield a so-called subword history. We investigate the information content of subword histories.

We investigate binary words and ω-words, mainly those generated by D0L systems. We compare the numbers of occurrences of ab and ba as (scattered) subwords ...

Nov 5, 2019 · In subword complexity, the main goal is to find explicit formulas for, or estimate, the number of distinct blocks of length n appearing in a ...

Salomaa, Subword balance in binary words, languages and sequences,. Fundam. Inform., 75 (2007) 469-482. 21. A. Salomaa, Upper triangular matrices and subword ...

top Parikh matrices have become a useful tool for investigation of subword structure of words. Several generalizations of this concept have been considered.