Related papers: Some Remarks on Almost Periodic Sequences and Lang…
By replacing the letters to polynomials in F_2[t], an infinite word, over a finite alphabet, can be seen as the sequence of partial quotients of a continued fraction in F_2((1/t)). Here is described a family of such infinite words,…
Quasi-Sturmian words, which are infinite words with factor complexity eventually $n+c$ share many properties with Sturmian words. In this paper, we study the quasi-Sturmian colorings on regular trees. There are two different types, bounded…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…
We prove that the composition of a quasi-nearly subharmonic function and a quasiregular mappings of bounded multiplicity is quasi-nearly subharmonic. Also, we prove that if $u\circ f$ is quasi-nearly subharmonic for all quasi-nearly…
The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…
Two finite words $u$ and $v$ are called Abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of (the shift orbit closure of) an infinite word $\mathbf{x}$ is the set…
We consider variations on the following problem: given an NFA M and a pattern p, does there exist an x in L(M) such that p matches x? We consider the restricted problem where M only accepts a finite language. We also consider the variation…
We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes & Rosenthal \cite{Berkes-Rosenthal:AlmostExchangeableSequences}. In order to do this, {itemize} We study and compare three…
Language sciences rely less and less on formal syntax as their base. The reason is probably its lack of psychological reality, knowingly avoided. Philosophers of science call for a paradigm shift in which explanations are by mechanisms, as…
Let $M\subset B(\mathcal H)$ be a von Neumann algebra acting on the Hilbert space $\mathcal H$. We prove that $M$ is finite if and only if, for every $x\in M$ and for all vectors $\xi,\eta\in\mathcal H$, the coefficient function $u\mapsto…
In the algebraic theory of codes and formal languages, the set $Q$ of all primitive words over some alphabet $\zi $ has received special interest. With this survey article we give an overview about relevant research to this topic during the…
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
Families of DFAs (FDFAs) have recently been introduced as a new representation of $\omega$-regular languages. They target ultimately periodic words, with acceptors revolving around accepting some representation $u\cdot v^\omega$. Three…
Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer. We provide such an investigation in terms…
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword" means "subsequence". A language is bifix-free if it is…
In this paper, we consider the asymptotic dynamics of the skew-product semiflow generated by the following time almost-periodically forced scalar reaction-diffusion equation \begin{equation}\label{eq0} u_{t}=u_{xx}+f(t,u,u_{x}),\,\,t>0,\,…
We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if…
Generalized pseudostandard words were introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated…
We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic…