Related papers: Abstract String Domain Defined with Word Equations…
Given two conformal field theories related to each other by a marginal perturbation, and string field theories constructed around such backgrounds, we show how to construct explicit redefinition of string fields which relate these two…
Techniques in which words are represented as vectors have proved useful in many applications in computational linguistics, however there is currently no general semantic formalism for representing meaning in terms of vectors. We present a…
Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…
In this paper, we present an approach to define the semantics for object-oriented modeling languages. One important property of this semantics is to support underspecified and incomplete models. To this end, semantics is given as predicates…
Automatic data abstraction is an important capability for both benchmarking machine intelligence and supporting summarization applications. In the former one asks whether a machine can `understand' enough about the meaning of input data to…
Classically domain theory is a rigourous mathematical structure to describe denotational semantics for programming languages and to study the computability of partial functions. Recently, the application of domain theory has also been…
We describe a general formalism based on the partial-wave decomposition to compute the iterative $s$-channel discontinuity of four-point amplitudes at any loop order. As an application, we focus on the low-energy expansions of type I and II…
Field Theory on Event Symmetric space-time is constructed using the gauge group of discrete open strings. Models with invariant actions can be viewed as natural extensions of Matrix Models. The objective is to find a fundamental…
We discuss the connection between Matrix string theory and the DLCQ of string theory. Using this connection we describe the sense in which perturbative string amplitudes are reproduced in the Matrix string theory. Using recent realization…
Let $S$ be a string of length $n$. In this paper we introduce the notion of \emph{string attractor}: a subset of the string's positions $[1,n]$ such that every distinct substring of $S$ has an occurrence crossing one of the attractor's…
We consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the pattern of length $m$ and a substring of a longer text. We give…
Generating an abstract from a collection of documents is a desirable capability for many real-world applications. However, abstractive approaches to multi-document summarization have not been thoroughly investigated. This paper studies the…
We study the cosmological evolution of domain walls bounded by strings which arise naturally in axion models. If we introduce a bias in the potential, walls become metastable and finally disappear. We perform two dimensional lattice…
While the utility of well-chosen abstractions for understanding and predicting the behaviour of complex systems is well appreciated, precisely what an abstraction $\textit{is}$ has so far has largely eluded mathematical formalization. In…
We concretely define the identity string field as a surface state and deal with it consistently in terms of conformal field theory language, never using its formal properties nor oscillator representation of it. The generalized gluing and…
The strength of a dynamic language is also its weakness: run-time flexibility comes at the cost of compile-time predictability. Many of the hallmarks of dynamic languages such as closures, continuations, various forms of reflection, and a…
Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently on instances of small…
We review the basics of the dynamics of closed strings moving along the discretized line \Z. The string excitations are described by a field \phi_x(\tau) where x is the position of the string in the embedding space and \tau is a…
Most ideas about what an algorithm is are very similar. Basic operations are used for transforming objects. The evaluation of internal and external states by relations has impact on the further process. A more precise definition can lead to…
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints in terms of the languages accepted by an automaton and a…