Related papers: On Solving String Equations via Powers and Parikh …
Composed image retrieval is a type of image retrieval task where the user provides a reference image as a starting point and specifies a text on how to shift from the starting point to the desired target image. However, most existing…
String constraint solving, and the underlying theory of word equations, are highly interesting research topics both for practitioners and theoreticians working in the wide area of satisfiability modulo theories. As string constraint solving…
We consider Parikh images of languages accepted by non-deterministic finite automata and context-free grammars; in other words, we treat the languages in a commutative way --- we do not care about the order of letters in the accepted word,…
By using truncation technique, minimization method and Morse theory, we obtain three nontrivial solutions for a class of semilinear elliptic equations.
We study solutions of the supergravity equations with the string-like sources moving with the speed of light. An exact solution is obtained for the gravitational field of a boosted ring string in any dimension greater than three.
In this paper, we propose two new methods for solving Set Constraint Problems, as well as a potential polynomial solution for NP-Complete problems using quantum computation. While current methods of solving Set Constraint Problems focus on…
We review recent advances towards the computation of string couplings. Duality symmetry, mirror symmetry, Picard-Fuchs equations, etc. are some of the tools.
The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…
We describe a general parameterized scheme of program and constraint analyses allowing us to specify both the program specialization method known as Turchin's supercompilation and Hmelevskii's algorithm solving the quadratic word equations.…
String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings. Communication complexity. For small $k$, we provide near-optimal upper…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
We discuss a new version of a method for obtaining exact solutions of nonlinear partial differential equations. We call this method the Simple Equations Method (SEsM). The method is based on representation of the searched solution as…
Solving arithmetic word problems is a cornerstone task in assessing language understanding and reasoning capabilities in NLP systems. Recent works use automatic extraction and ranking of candidate solution equations providing the answer to…
In this paper we present a new approach to proving some exponential inequalities involving the sinc function. Power series expansions are used to generate new polynomial inequalities that are sufficient to prove the given exponential…
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…
Given a regular expression $R$ and a string $Q$, the regular expression parsing problem is to determine if $Q$ matches $R$ and if so, determine how it matches, e.g., by a mapping of the characters of $Q$ to the characters in $R$. Regular…
We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…
We introduce the notion of general prints of a word, which is substantialized by certain canonical decompositions, to study repetition in words. These associated decompositions, when applied recursively on a word, result in what we term as…
Using the Ernst potential formulation we construct all it finite symmetry transformations which preserve asymptotics of the bosonic fields of the (d+3)--dimensional low--energy heterotic string theory compactified on a d--torus. We combine…