相关论文: Watson-Crick strong bi-catenation on words
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Zipf's law predicts a power-law relationship between word rank and frequency in language communication systems and has been widely reported in a variety of natural language processing applications. However, the emergence of natural language…
The state complexity of the result of a regular operation is often positively correlated with the number of distinct transformations induced by letters in the minimal deterministic finite automaton of the input languages. That is, more…
In this paper we study generalization of the reversal mapping realized by an arbitrary involutory antimorphism $\Theta$. It generalizes the notion of a palindrome into a $\Theta$-palindrome -- a word invariant under $\Theta$. For languages…
We present three syntactic forcing models for coherent logic. These are based on sites whose underlying category only depends on the signature of the coherent theory, and they do not presuppose that the logic has equality. As an application…
Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite…
Let $A$ and $B$ be compact operators over a topological space $X$ and suppose that these operators are normal and have same distinct eigenvalues at each point. By obstruction theory, we establish a necessary and sufficient condition for $A$…
We investigate the dynamics of an injection locked in-plane uniform spin torque oscillator for several forcing configurations at large driving amplitudes. For the analysis, the spin wave amplitude equation is used to reduce the dynamics to…
Utilizing the Foldy-Wouthuysen representation, we use a bottom-up approach to construct heavy-baryon Lagrangian terms, without employing a relativistic Lagrangian as the starting point. The couplings obtained this way feature a…
Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This…
Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the…
We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem…
We study conditions so that the determinantal point process $\Lambda_\phi$ associated to a generalized Fock space defined by a doubling subharmonic weight $\phi$ is almost surely a separated sequence in $\mathbb C$. Under a natural…
In the present paper we consider biologically motivated reduction operations on double occurrence words. Then we define the nesting index of a double occurrence word to be the least number of reduction operations it takes for a word to be…
A continuous sequence of infinitesimal unitary transformations is used to diagonalize the quantum sine-Gordon model for \beta^2\in(2\pi,\infty). This approach can be understood as an extension of perturbative scaling theory since it links…
Tandem duplication in DNA is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain {\em et al.} (2016) proposed the study of codes that…
Most automated verifiers for separation logic target the symbolic-heap fragment, disallowing both the magic-wand operator and the application of classical Boolean operators to spatial formulas. This is not surprising, as support for the…
The relationship between words in a sentence often tells us more about the underlying semantic content of a document than its actual words, individually. In this work, we propose two novel algorithms, called Flexible Lexical Chain II and…
A general method of the Foldy-Wouthyusen (FW) transformation for relativistic particles of arbitrary spin in strong external fields has been developed. The use of the found transformation operator is not restricted by any definite…
A double occurrence word (DOW) is a word in which every symbol appears exactly twice; two DOWs are equivalent if one is a symbol-to-symbol image of the other. We consider the so called repeat pattern ($\alpha\alpha$) and the return pattern…