Related papers: A Solver for a Theory of Strings and Bit-vectors

String theory dynamics on certain fivebrane supertube backgrounds is described by an exactly solvable null-gauged WZW model. We use this description to compute the spectrum of closed string excitations on the three-charge non-supersymmetric…

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

String-averaging is an algorithmic structure used when handling a family of operators in situations where the algorithm at hand requires to employ the operators in a specific order. Sequential orderings are well-known and a simultaneous…

We discuss the string theory on AdS_3. In the first half of this talk, we review the SL(2,R) and the SL(2,C)/SU(2) WZW models which describe the strings on the Lorentzian and Euclidean AdS_3 without RR backgrounds, respectively. An emphasis…

We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…

The equation of motion for Berkovits' WZW-like open (super)string field theory is shown to be integrable in the sense that it can be written as the compatibility condition ("zero-curvature condition") of some linear equations. Employing a…

For high-assurance software, source-level reasoning is insufficient: we need binary-level guarantees. Despite constrained Horn clause (CHC) solving being one of the most popular forms of automated verification, prior work has not evaluated…

We develop the idea for a new string field theory of ours that was proposed earlier in a very rudimentary form in a talk in the Symposium of Tohwa University [1]. The main point is to describe the system of strings in the Universe by means…

In this paper, we consider the satisfiability problem for string logic with equations, regular membership and Presburger constraints over length functions. The difficulty comes from multiple occurrences of string variables making…

Consensus problems for strings and sequences appear in numerous application contexts, ranging from bioinformatics over data mining to machine learning. Closing some gaps in the literature, we show that several fundamental problems in this…

We study the fundamental issue of decidability of satisfiability over string logics with concatenations and finite-state transducers as atomic operations. Although restricting to one type of operations yields decidability, little is known…

We introduce string2string, an open-source library that offers a comprehensive suite of efficient algorithms for a broad range of string-to-string problems. It includes traditional algorithmic solutions as well as recent advanced neural…

We propose a new general BRST approach to string and string-like theories which have a wider range of applicability than e g the conventional conformal field theory method. The method involves a simple general regularization of all basic…

The most disappointing aspect of $\W$-strings is probably the fact that at least for the known models one does not recover a physical spectrum that differs much from that of ordinary string theory. It is hoped that this is not an intrinsic…

It is known that the exact form of the Burrows-Wheeler-Transform (BWT) of a string collection depends, in most implementations, on the input order of the strings in the collection. Reordering strings of an input collection affects the…

We study string theory in supersymmetric time-dependent backgrounds. In the framework of general relativity, supersymmetry for spacetimes without flux implies the existence of a covariantly constant null vector, and a relatively simple form…

This thesis is almost entirely devoted to studying string theory backgrounds characterized by simple geometrical and integrability properties. The archetype of this type of system is given by Wess-Zumino-Witten models, describing string…

We uncover a remarkable role that an infinite hierarchy of non-linear differential equations plays in organizing and connecting certain {hat c}<1 string theories non-perturbatively. We are able to embed the type 0A and 0B (A,A) minimal…

The Test Template Framework (TTF) is a model-based testing method for the Z notation. In the TTF, test cases are generated from test specifications, which are predicates written in Z. In turn, the Z notation is based on first-order logic…

Even at tree level, the first quantized string theory suffers from apparent short distance singularities associated with collision of vertex operators that prevent us from straightforward numerical computation of various quantities.…