Related papers: Associative string functions

A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…

In this article, we define the Set Shaping Theory whose goal is the study of the bijection functions that transform a set of strings into a set of equal size made up of strings of greater length. The functions that meet this condition are…

In this note we expose some surprising connections between string theory and statistical inference. We consider a large collective of agents sweeping out a family of nearby statistical models for an M-dimensional manifold of statistical…

We introduce collages of string diagrams as a diagrammatic syntax for glueing multiple monoidal categories. Collages of string diagrams are interpreted as pointed bimodular profunctors. As the main examples of this technique, we introduce…

This paper expresses the structure of artificial neural network (ANN) as a functional form, using the activation integral concept derived from the activation function. In this way, the structure of ANN can be represented by a simple…

Using a classical action associated to a point-particle in (1+1)-dimensions the classical string theory is derived. In connection with this result two aspects are clarified: First, the point particle in (1+1)-dimensions is not an ordinary…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

In these lecture notes, an introduction to superstring theory is presented. Classical strings, covariant and light-cone quantization, supersymmetric strings, anomaly cancelation, compactification, T-duality, supersymmetry breaking, and…

String diagrams are a graphical language used to represent processes that can be composed sequentially or in parallel, which correspond graphically to horizontal or vertical juxtaposition. In this paper we demonstrate how to compute the…

An attempt at unifying logic and functional programming is reported. As a starting point, we take the view that "logic programs" are not about logic but constitute inductive definitions of sets and relations. A skeletal language design…

These four lectures, addressed to an audience of graduate students in experimental high energy physics, survey some of the basic concepts in string theory. The purpose is to convey a general sense of what string theory is and what it has…

We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context structural rules given by exchange (linear theory)…

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…

This is a one semester course on bosonic string theory aimed at beginning graduate students. The lectures assume a working knowledge of quantum field theory and general relativity. Contents: 1. The Classical String 2. The Quantum String 3.…

In this paper, a new approach to string dynamics is proposed. String coordinates are identified with a non-commuting set of operators familiar from free string quantization, and the dynamics follows from the Virasoro algebra. There is a…

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 investigate uniqueness problems for an entire function that shares two small functions of finite order with their difference operators. In particular, we give a generalization of a result in $[2]$.

The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…