Related papers: String-to-String Interpretations with Polynomial-S…

It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the {\lambda}-calculus definition of polyregular functions from Boja\'nczyk (2018). In this…

We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive…

In this paper we show that the holomorphic representation is appropriate for description in a consistent way string and string field theories, when the considered number of component fields of the string field is finite. A new Lagrangian…

There is an interpretation of open string field theory in algebraic topology. An interpretation of closed string field theory can be deduced from this open string theory to obtain as well the interpretation of open and closed string field…

A two dimensional string effective action is obtained by dimensionally reducing the bosonic part of the ten dimensional heterotic string effective action. It is shown that this effective action, with a few restrictions on some backgrounds…

Multiloop superstring amplitudes are calculated in the explicit form by the solution of Ward identities. A naive generalization of Belavin-Knizhnik theorem to the superstring is found to be incorrect since the period matrix turns out to be…

We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string…

We investigate a natural generalization to trees of Hennie machines, a known automaton model for regular string functions. Tree-to-tree Hennie machines are tree-walking tree transducers with the ability to rewrite the node labels of their…

Computing string or sequence alignments is a classical method of comparing strings and has applications in many areas of computing, such as signal processing and bioinformatics. Semi-local string alignment is a recent generalisation of this…

We present a string theory realization for the correspondence between quantum integrable models and supersymmetric gauge theories. The quantization results from summing the effects of fundamental strings winding around a compact direction.…

We formulate matrix string models on a class of exact string backgrounds with non constant RR-flux parameterized by a holomorphic prepotential function and with manifest (2,2) supersymmetry. This lifts these string theories to M-theory…

We propose a novel string theory propagating in a non-commutative deformation of the four dimensional space T* T^2 whose scattering states correspond to superconformal theories in 5 dimensions and the scattering amplitudes compute…

String theory is canonically accompanied with a space-time interpretation which determines S-matrix-like observables, and connects to the standard physics at low energies in the guise of local effective field theory. Recently, we have…

We prove a characterization of first-order string-to-string transduction via $\lambda$-terms typed in non-commutative affine logic that compute with Church encoding, extending the analogous known characterization of star-free languages. We…

In this paper, we survey the complexity of distinct methods that allow the programmer to synthesize a sup-interpretation, a function providing an upper- bound on the size of the output values computed by a program. It consists in a static…

Dynamics of a free point particle on a multi world-line is presented and shown to reduce to that of a bosonic string theory at the appropriate limit. Other higher dimensional extended objects are argued to appear at other regions of the…

We review the status of duality symmetries in superstring theories. These discrete symmetries mark the striking differences between theories of pointlike objects and theories of extended objects. They prove to be very helpful in…

Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on…

A class of graph languages is definable in Monadic Second-Order logic (MSO) if and only if it consists of sets of models of MSO formul{\ae}. If, moreover, there is a computable bound on the tree-widths of the graphs in each such set, the…

This paper investigates the relationships between closed and mixed string amplitudes at the tree level in string theory. Through the analytic continuation of complex variables, we establish a factorization of closed string amplitudes into…