English
Related papers

Related papers: FO-definable transformations of infinite strings

200 papers

We answer an open question in the theory of transducer degrees initially posed in [1] on the existence of a diamond structure in the transducer hierarchy. Transducer degrees are the equivalence classes formed by word transformations which…

Formal Languages and Automata Theory · Computer Science 2023-01-18 Noah Kaufmann

We study general properties of the classical solutions in non-polynomial closed string field theory and their relationship with two dimensional conformal field theories. In particular we discuss how different conformal field theories which…

High Energy Physics - Theory · Physics 2007-05-23 Ashoke Sen

By replacing the letters to polynomials in F_2[t], an infinite word, over a finite alphabet, can be seen as the sequence of partial quotients of a continued fraction in F_2((1/t)). Here is described a family of such infinite words,…

Number Theory · Mathematics 2022-12-02 Alain Lasjaunias

Digital Transforms have important applications on subjects such as channel coding, cryptography and digital signal processing. In this paper, two Fourier Transforms are considered, the discrete time Fourier transform (DTFT) and the finite…

We investigate numerically the configurational statistics of strings. The algorithm models an ensemble of global $U(1)$ cosmic strings, or equivalently vortices in superfluid $^4$He. We use a new method which avoids the specification of…

High Energy Physics - Theory · Physics 2009-10-28 M. Hindmarsh , K. Strobl

We discuss different formulations and approaches to string theory and $ 2d$ quantum gravity. The generic idea to get a unique description of {\it many} different string vacua altogether is demonstrated on the examples in $ 2d$ conformal,…

High Energy Physics - Theory · Physics 2009-10-28 A. Marshakov

We uncover a remarkable role that an infinite hierarchy of non-linear differential equations plays in organizing and connecting certain {hat c}<1 string theories non-perturbatively. We are able to embed the type 0A and 0B (A,A) minimal…

High Energy Physics - Theory · Physics 2014-08-07 Ramakrishnan Iyer , Clifford V. Johnson , Jeffrey S. Pennington

We develop a systematic framework for understanding symmetries in topological phases in 2+1 dimensions using the string-net model, encompassing both gauge symmetries that preserve anyon species and global symmetries permuting anyon species,…

Strongly Correlated Electrons · Physics 2025-12-01 Yu Zhao , Yidun Wan

We provide general criteria for the existence of minimal models of streaming transducers, namely devices that read an input word and produce an output value by iteratively updating an internal memory. This abstract model subsumes classical…

Formal Languages and Automata Theory · Computer Science 2026-05-14 Christian Bianchini , Gabriele Puppis

Temporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity. LTL is equivalent in…

Logic in Computer Science · Computer Science 2025-07-16 Kevin W. Smith , Moshe Y. Vardi

String theory appears to admit a group of discrete field transformations -- called $S$ dualities -- as exact non-perturbative quantum symmetries. Mathematically, they are rather analogous to the better-known $T$ duality symmetries, which…

High Energy Physics - Theory · Physics 2011-04-15 John H. Schwarz

We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of nonterminal nodes (edges) to delete so that the terminal nodes do…

Data Structures and Algorithms · Computer Science 2018-04-09 Karthekeyan Chandrasekaran , Matthias Mnich , Sahand Mozaffari

We answer an open question in the theory of transducer degrees on the existence of a diamond structure in the transducer hierarchy. Transducer degrees are the equivalence classes formed by word transformations which can be realized by a…

Formal Languages and Automata Theory · Computer Science 2025-12-17 Noah Kaufmann

These lectures provide an introduction to perturbative string theory and its construction on spaces with background Ramond flux. Traditional covariant quantization of the string and its connection with vertex operators and conformal…

High Energy Physics - Theory · Physics 2007-05-23 L. Dolan

In formal language theory, several different models characterize regular languages, such as finite automata, congruences of finite index, or monadic second-order logic (MSO). Moreover, several fragments of MSO have effective…

Formal Languages and Automata Theory · Computer Science 2015-06-23 Nathan Lhote

We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have…

Logic · Mathematics 2014-09-19 Philip Welch

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Logic · Mathematics 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

We summarize the results obtained in the last few years about permutation orbifolds in two-dimensional conformal field theories, their application to string theory and their use in the construction of four-dimensional heterotic string…

High Energy Physics - Theory · Physics 2011-11-07 M. Maio

Symmetry transformations of the space-time fields of string theory are generated by certain similarity transformations of the stress-tensor of the associated conformal field theories. This observation is complicated by the fact that, as we…

High Energy Physics - Theory · Physics 2011-07-19 Mark Evans , Ioannis Giannakis , D. V. Nanopoulos

Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting.…

Logic in Computer Science · Computer Science 2023-06-22 Dexter Kozen