Related papers: FO-definable transformations of infinite strings
A uniformization of a binary relation is a function that is contained in the relation and has the same domain as the relation. The synthesis problem asks for effective uniformization for classes of relations and functions that can be…
We use a recently proposed class of tensor-network states to study phase transitions in string-net models. These states encode the genuine features of the string-net condensate such as, e.g., a nontrivial perimeter law for Wilson loops…
In recent years there has been considerable interest in theories over string equations, length function, and string-number conversion predicate within the formal verification, software engineering, and security communities. SMT solvers for…
Generalized indefinite strings provide a canonical model for self-adjoint operators with simple spectrum (other classical models are Jacobi matrices, Krein strings and 2x2 canonical systems). We prove a number of Szeg\H{o}-type theorems for…
The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the…
We show that the $c=1$ bosonic string theory at finite temperature has two matrix-model realizations related by a kind of duality transformation. The first realization is the standard one given by the compactified matrix quantum mechanics…
We show that given any two classical solutions in open string field theory and a singular gauge transformation relating them, it is possible to write the second solution as a gauge transformation of the first plus a singular, projector-like…
This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…
Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…
We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one…
This is a tutorial on finite automata. We present the standard material on determinization and minimization, as well as an account of the equivalence of finite automata and monadic second-order logic. We conclude with an introduction to the…
We consider the equations of motion of the full heterotic string field theory including both the Neveu-Schwarz and the Ramond sectors. It is shown that they can be formulated in the form of an infinite number of first-order equations for an…
We study supertranslations at spatial and future timelike infinity in the first-order formalism. We relax the Ashtekar-Engle-Sloan boundary conditions to allow supertranslations at the spatial infinity and obtain the precise form of the…
An O($\tilde{d}$, $\tilde{d}$) transformation is given which relates ungauged string actions to the gauged ones for a large class of models discussed recently by Giveon and Rocek. Interestingly, the transformation is background independent…
MSO transductions are binary relations between structures which are defined using monadic second-order logic. MSO transductions form a category, since they are closed under composition. We show that many notions from language theory, such…
We construct a family of exactly solvable spin models that illustrate a novel mechanism for fractionalization in topologically ordered phases, dubbed the string flux mechanism. The essential idea is that an anyon of a topological phase can…
The asynchronous systems f are multi-valued functions, representing the non-deterministic models of the asynchronous circuits from the digital electrical engineering. In real time, they map an 'admissible input' function…
Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…
We introduce the concept of a prime band in a string algebra $\Lambda$ and use it to associate to $\Lambda$ its finite bridge quiver. Then we introduce a new technique of `recursive systems' for showing that a graph map between finite…
A word-to-word function is continuous for a class of languages~$\mathcal{V}$ if its inverse maps $\mathcal{V}$_languages to~$\mathcal{V}$. This notion provides a basis for an algebraic study of transducers, and was integral to the…