Abstract: The following sections are included: Numerical Information About Words. The Cauchy Inequality. A Proof Using Combinatorial Arguments.

(In classical language theory, [8], our subwords are usually called "scattered subwords", whereas our factors are called "subwords". There is quite much ...

Aug 5, 2021 · We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total ...

May 29, 2017 · Abstract:We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers.

We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total number of palindromic ...

This paper introduces the notion of a subword condition and investigates languages defined by them. The special case, where the language reduces to one word ...

Jun 24, 2020 · Inspired by vincular permutation patterns we define what it means for a subword to be restricted by an auxiliary index set. R; this definition ...

We investigate the question of unification in the linear modal logic on non-transitive time with the universal modality. The semantic construction of logic ...

Abstract. We consider the sequence (Sb(n))n≥0 counting the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative ...

The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words when the gaps are of length from a given set ...