In this paper we study the number $$r_{\texttt {bwt}}$$ of equal-letter runs produced by Burrows-Wheeler transform (BWT) when it is applied to purely morphic finite words, which are words generated iterating prolongable morphisms. Such a parameter very significant since provides measure performances BWT, in terms both compressibility and indexing. particular, prove that, BWT whichever word on b...

We present a new way of obtaining the Bargmann transform between L 2 (R n) and the Fock space F = F(C n) via a simple restriction principle applied to holo-morphic functions. This same principle also recovers the transform between functions on a compact Lie group and holomorphic functions on its complexii-cation studied by Gross, Hall, Hijab et al., see 1] and 2], and it gives in a similar way ...

In the present paper, we introduce an alternative notion of the primitivity of words, that – unlike the standard understanding of this term – is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet Σ, we call a word w ∈ Σ∗ morphically imprimitive provided that there are a shorter word v and morphisms h, h′ : Σ∗ → Σ∗ satisfying h(v) = w and h′(w) = ...

The Langlands philosophy contemplates the relation between auto-morphic representations and Galois representations. A particularly interesting case is that of the non-selfdual automorphic representations of GL 3. Clozel conjectured that the L-functions of certain of these are equal to L-functions of Galois representations. Here we announce that we found an example of such an automorphic represe...

This paper aims to investigate properties of involution palindrome languages. Let θ be either a morphic or antimorphic involution. we show that if θ is an antimorphic involution, then the set of all θ-palindrome words is a proper subset of all skew θ-palindrome words. We give a characterization for that a word is skew θ-palindrome. That is, A word is skew θ-palindrome if and only if it is a pro...

This paper is a theoretical study of notions in combinatorics of words motivated by information being encoded as DNA strands in DNA computing. We generalize the classical notions of conjugacy and commutativity of words to incorporate the notion of an involution function, a formalization of the Watson-Crick complementarity of DNA single-strands. We define and study properties of Watson-Crick con...

There are grounds for questioning whether translation done by computer should resemble closely, either in process or in product, translation done manually. Several workers in machine translation have proposed radical departures from the naively adopted goal of simulating manual translation mechanically. Because they saw a similarity between their mechanically feasible output and the pidgin lang...

We introduce and study a modal logic wK4F which is closely related to the logic S4F that is important in the context of epistemic logics for representing and reasoning about an agent’s knowledge. It is obtained by adding the axiom F to the modal logic wK4, or dropping from S4F the T axiom. We show that wK4F is sound and complete with respect to the class of all minimal topological spaces i.e. t...