Related papers: String-to-String Interpretations with Polynomial-S…
This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…
The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and provide operations such as accessing elements, concatenation,…
The divergences that arise in the regularized partition function for closed bosonic string theory in flat space lead to three types of perturbation series expansions, distinguished by their genus dependence. This classification of…
We consider Penrose limits of the Klebanov-Strassler and Maldacena-Nunez holographic duals to N =1 supersymmetric Yang-Mills. By focusing in on the IR region we obtain exactly solvable string theory models. These represent the…
In this note we observe that, contrary to the usual lore, string orbifolds do not describe strings on quotient spaces, but rather seem to describe strings on objects called quotient stacks, a result that follows from simply unraveling…
String analysis is the problem of reasoning about how strings are manipulated by a program. It has numerous applications including automatic detection of cross-site scripting (XSS). A popular string analysis technique includes symbolic…
We define two classes of functions, called regular (respectively, first-order) list functions, which manipulate objects such as lists, lists of lists, pairs of lists, lists of pairs of lists, etc. The definition is in the style of regular…
In a previous paper, the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. Basically, a sup-interpretation provides an upper bound…
In recent work, several classes of solitonic solutions of string theory with higher-membrane structure have been obtained. These solutions can be classified according to the symmetry possessed by the solitons in the subspace of the…
We identify string corrections to the EM memory effect. Though largely negligible in the low-energy limit, the effect become relevant in high-energy collisions and in extreme events. We illustrate our findings in a simple unoriented bosonic…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
With our current level of understanding, the problem of making string theory predictions is not one of "solving" the theory, but rather of trying to determine whether there are any generic expectations. Within this context, we discuss what…
We realize bosonic string theory with ensembles of infinite width neural networks. The string tension is tuned by the variance of the output weights. The construction provides a new computation of the foundational Virasoro-Shapiro and…
This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may…
Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper…
Type IIB string theory admits a BPS configuration in which three strings (of different type) meet at a point. Using this three string configuration we construct a string network and study its properties. In particular we prove supersymmetry…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
Regular model checking is an exploration technique for infinite state systems where state spaces are represented as regular languages and transition relations are expressed using rational relations over infinite (or finite) strings. We…
We demonstrate that string consistency in four spacetime dimensions leads to a spectrum of string states which satisfies the supertrace constraints Str(M^0)=0 and Str(M^2)=\Lambda at tree level, where \Lambda is the one-loop string…
In this paper we describe how representation theory of groups can be used to shorten the derivation of two loop partition functions in string theory, giving an intrinsic description of modular forms appearing in the results of D'Hoker and…