相关论文: Bispecial factors in circular non-pushy D0L langua…

Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a…

We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a…

In this paper we consider the problem of locating a nonzero entry in a high-dimensional vector from possibly adaptive linear measurements. We consider a recursive bisection method which we dub the compressive binary search and show that it…

In this paper we study holomorphic properties of infinite dimensional spin factors. Among the infinite dimensional Banach spaces with homogeneous open unit balls, we show that the spin factors are natural outlier spaces in which to ask the…

We call a subfactor trivial if it is isomorphic with the obvious inclusion of N into matrices over N. We prove the existence of type II_1 factors M without non-trivial finite index subfactors. Equivalently, every M-M-bimodule with finite…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

A position $p$ in a word $w$ is critical if the minimal local period at $p$ is equal to the global period of $w$. According to the Critical Factorisation Theorem all words of length at least two have a critical point. We study the number…

We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering…

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

Let $H$ be an HD0L-system. We show that there are only finitely many primitive words $v$ with the property that $v^k$, for all integers $k$, is an element of the factorial language of $H$. In particular, this result applies to the set of…

On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide…

Methods of determining, from small-variable asymptotic expansions, the characteristic exponents for variables tending to infinity are analyzed. The following methods are considered: diff-log Pad\'e summation, self-similar factor…

Networked discrete dynamical systems are often used to model the spread of contagions and decision-making by agents in coordination games. Fixed points of such dynamical systems represent configurations to which the system converges. In the…

On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we…

We study the properties of the ternary infinite word p = 012102101021012101021012 ... , that is, the fixed point of the map h:0->01, 1->21, 2->0. We determine its factor complexity, critical exponent, and prove that it is 2-balanced. We…

Given a regular language $L$, we study the language of words $\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed…

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least…

Knowing the features of a complex system that are highly relevant to a particular target variable is of fundamental interest in many areas of science. Existing approaches are often limited to linear settings, sometimes lack guarantees, and…

We introduce a class of fixed points of primitive morphisms among aperiodic binary generalized pseudostandard words. We conjecture that this class contains all fixed points of primitive morphisms among aperiodic binary generalized…