相关论文: On prefixal factorizations of words

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by…

In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…

We consider a new family of factorial languages whose subword complexity grows as $\Theta(n^{\alpha})$, where $\alpha$ is the root of some transcendent equation. Analytical methods and in particular, a corollary of the Wiener-Pitt theorem,…

In this paper we consider the computational complexity of the following problems: given a DFA or NFA representing a regular language L over a finite alphabet Sigma is the set of all prefixes (resp., suffixes, factors, subwords) of all words…

Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we investigate another possibility of tabling, i.e. to compute an infinite sum of probabilities for probabilistic…

We propose a formalization of the three-tier causal hierarchy of association, intervention, and counterfactuals as a series of probabilistic logical languages. Our languages are of strictly increasing expressivity, the first capable of…

Let $\mathcal{H}=\{H_i: i<\alpha \}$ be an indexed family of graphs for some ordinal number $\alpha$. $\mathcal{H}$-decomposition of a graph $G$ is a family $\mathcal{G}=\{G_i: i<\alpha \}$ of edge-disjoint subgraphs of $G$ such that $G_i$…

A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible…

We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

For two natural numbers $1<p_1<p_2$, with $\alpha = \frac{\log(p_1)}{\log(p_2)}$ irrational, we describe, in main Theorem $\Omega$ and in Note $1.5$, the factorization of two adjacent numbers in the multiplicatively closed subset $S =…

Let $H$ be a Krull monoid with infinite cyclic class group $G$ and let $G_P \subset G$ denote the set of classes containing prime divisors. We study under which conditions on $G_P$ some of the main finiteness properties of factorization…

In this paper we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite words which are both recurrent and aperiodic by projection.…

Partially ordered automata are automata where the transition relation induces a partial order on states. The expressive power of partially ordered automata is closely related to the expressivity of fragments of first-order logic on finite…

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…

This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).

Let for a prime $p$, $\mathfrak{X}$ (respectively $\mathfrak{Y}$) be the class of all $p$-biprimitively finite (respectively periodic $p$-conjugatively biprimitively finite) groups and $G\in \mathfrak{X}$ (respectively $G\in \mathfrak{Y}$),…

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

A finite word $u$ is called closed if its longest repeated prefix has exactly two occurrences in $u,$ once as a prefix and once as a suffix. We study the function $f_x^c:\mathbb N \rightarrow \mathbb N$ which counts the number of closed…

In this article, we investigate a unique prime factorization property for infinite tensor product factors. We provide several examples of type II and III factors which satisfy this property, including all free product factors with diffuse…