Related papers: On Solving String Equations via Powers and Parikh …
We study the evolution of strings in the equatorial plane of a Kerr-Newmann black hole. Writting the equations of motion and the constraints resulting from Hamilton's principle, three classes of exact solutions are presented, for a closed…
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and total size 2^{O(k^2 log n)}, i.e., polynomial for all fixed k…
The black hole solutions to Einstein's vacuum field equations are also solutions to the equations of motion of the low energy limit of superstring theory. At the same time, string theory boasts a much broader and richer collection of black…
Transcribing struck-through, handwritten words, for example for the purpose of genetic criticism, can pose a challenge to both humans and machines, due to the obstructive properties of the superimposed strokes. This paper investigates the…
We study a fixed point iterative method based on generalized relaxation of strictly quasi-nonexpansive operators. The iterative method is assembled by averaging of strings, and each string is composed of finitely many strictly…
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic…
Power Series Solution method has been used traditionally for to solve Linear Differential Equations, in Ordinary and Partial form. But this method has been limited to this kind of problems. We present the solution of problems of Non Linear…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
In this note we develop a numerical method for partial differential equations with changing type. Our method is based on a unified solution theory found by Rainer Picard for several linear equations from mathematical physics. Parallel to…
Stretching is a new sparse matrix method that makes matrices sparser by making them larger. Stretching has implications for computational complexity theory and applications in scientific and parallel computing. It changes matrix sparsity…
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…
We reconsider here the problem of finding the general 4D spherically symmetric, asymptotically flat and time-independent solutions to the lowest-order string equations in the $\ap$ expansion. Our construction includes earlier work, but…
Strings are a natural representation of biological data such as DNA, RNA and protein sequences. The problem of finding a string that summarizes a set of sequences has direct application in relative compression algorithms for genome and…
In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually. The key tool in the development of this framework is the…
We address the problem of performing semantic transformations on strings, which may represent a variety of data types (or their combination) such as a column in a relational table, time, date, currency, etc. Unlike syntactic…
In this paper we study a variant of string pattern matching which deals with tuples of strings known as \textit{multi-track strings}. Multi-track strings are a generalisation of strings (or \textit{single-track strings}) that have primarily…
In this note we construct self-dual cosmic strings from a gauge field theory with a generalized linear formation of potential energy density. By integrating the Einstein equation, we obtain a nonlinear elliptic equation which is equal with…
This paper is a continuation of the paper by S.P.Novikov in Funct.Anal.Appl., v.24(1990), No 4, pp 196-206. String equation is by definition the equation $[L,A]=1$ for the coefficients of two linear ordinary differential operators $L$ and…
Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…
In this paper we extend Newton-Steffenssen method for solving nonlinear equations, introduced by Sharma [J.R. Sharma, A composite third order Newton-Steffenssen method for solving nonlinear equations, Appl. Math. Comput. 169 (2005),…