Related papers: On Prefix Normal Words and Prefix Normal Forms
The dot-depth hierarchy is a classification of star-free languages. It is related to the quantifier alternation hierarchy of first-order logic over finite words. We consider fragments of languages with dot-depth 1/2 and dot-depth 1 obtained…
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…
This short article is aimed at educators and teachers of mathematics.Its goal is simple and direct:to explore some of the basic/elementary properties of proper rational numbers.A proper rational number is a rational which is not an integer.…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, $k$-Fibonacci words, and their combinatorial properties. We established that the $n$-th root of the absolute value of terms in…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
Let $q$ be a positive integral power of some prime $p$ and $\mathbb{F}_{q^m}$ be a finite field with $q^m$ elements for some $m \in \mathbb{N}$. Here we establish a sufficient condition for the existence of primitive normal pairs of the…
Grammatical features such as number and gender serve two central functions in human languages. While they encode salient semantic attributes like numerosity and animacy, they also offload sentence processing cost by predictably linking…
An element $\alpha \in \mathbb {F}_{q^n}$ is normal over $\mathbb {F}_q$ if $\alpha$ and its conjugates $\alpha, \alpha^q, \cdots \alpha^{q^{n-1}}$ form a basis of $\mathbb {F}_{q^n}$ over $\mathbb {F}_q$. Recently, Huczynska, Mullen,…
A word is said to be bordered if it contains a nonempty proper prefix that is also a suffix. A pair of words $(u, v)$ is said to be mutually bordered if there exists a word that is a nonempty proper prefix of $u$ and suffix of $v$, and…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called…
We approach the problem of generalizing pre-trained word embeddings beyond fixed-size vocabularies without using additional contextual information. We propose a subword-level word vector generation model that views words as bags of…
This paper is about pregroup models of natural languages, and how they relate to the explicitly categorical use of pregroups in Compositional Distributional Semantics and Natural Language Processing. These categorical interpretations make…
The present study uses a computational approach to examine the role of semantic constraints in normal reading. This methodology avoids confounds inherent in conventional measures of predictability, allowing for theoretically deeper accounts…
In this paper we introduce and study new notions of uniform recurrence in multidimensional words. A $d$-dimensional word is called \emph{uniformly recurrent} if for all $(s_1,\ldots,s_d)\in\mathbb{N}^d$ there exists $n\in\mathbb{N}$ such…
Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…
FC is a first-order logic that reasons over all factors of a finite word using concatenation, and can define non-regular languages like that of all squares (ww). In this paper, we establish that there are regular languages that are not…
This report is mostly written for educational purposes. It is meant as a self contained introduction to regular languages, regular expressions, and regular expression matching by using Brzozowski derivatives. As such it is mostly based on…
The prefix exchange distance of a permutation is the minimum number of exchanges involving the leftmost element that sorts the permutation. We give new combinatorial proofs of known results on the distribution of the prefix exchange…