English
Related papers

Related papers: FO-definable transformations of infinite strings

200 papers

We study the formation of cosmic strings by confining a stochastic magnetic field into flux tubes in a numerical simulation. We use overdamped evolution in a potential that is minimized when the flux through each face in the simulation…

High Energy Physics - Theory · Physics 2008-11-26 Jose J. Blanco-Pillado , Ken D. Olum , Alexander Vilenkin

A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…

Combinatorics · Mathematics 2024-01-24 Susan Jowett , Dillon Mayhew , Songbao Mo , Christopher Tuffley

The conjecture that M-theory has the rank eleven Kac-Moody symmetry e11 implies that Type IIA and Type IIB string theories in ten dimensions possess certain infinite dimensional perturbative symmetry algebras that we determine. This…

High Energy Physics - Theory · Physics 2009-11-07 Matthias R Gaberdiel , Peter C West

We study confining strings in massive adjoint two-dimensional chromodynamics. Off-shell, as a consequence of zigzag formation, the resulting worldsheet theory provides a non-trivial dynamical realization of infinite quon statistics. Taking…

High Energy Physics - Theory · Physics 2020-11-03 John C. Donahue , Sergei Dubovsky

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding

For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b <…

Formal Languages and Automata Theory · Computer Science 2022-05-30 Didier Caucal , Chloé Rispal

In the past three years our views on how the standard model of particle physics could be embedded into string theory have dramatically changed. The heterotic string is no longer the only possibility for such an embedding and other…

High Energy Physics - Phenomenology · Physics 2011-04-15 L. E. Ibanez

Mechanical resonator networks are currently discussed in the context of model systems giving insight into problems of condensed matter physics including effects in topological phases. Here, we discuss networks based on three high-quality…

Mesoscale and Nanoscale Physics · Physics 2020-11-17 Daniel Schwienbacher , Thomas Luschmann , Rudolf Gross , Hans Huebl

One of the main topics in the modern String Theory are the AdS/CFT dualities. Proving such conjectures is extremely difficult since the gauge and string theory perturbative regimes do not overlap. In this perspective, the discovery of…

High Energy Physics - Theory · Physics 2014-11-21 Valentina Giangreco M. Puletti

In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of…

Logic in Computer Science · Computer Science 2021-11-23 Anthony W. Lin , Philipp Rümmer

We study some natural connections on spaces of conformal field theories using an analytical regularization method. The connections are based on marginal conformal field theory deformations. We show that the analytical regularization…

High Energy Physics - Theory · Physics 2009-10-30 Alexander von Gussich , Per Sundell

We study the sequence-to-sequence mapping capacity of transformers by relating them to finite transducers, and find that they can express surprisingly large classes of transductions. We do so using variants of RASP, a programming language…

Formal Languages and Automata Theory · Computer Science 2024-11-07 Lena Strobl , Dana Angluin , David Chiang , Jonathan Rawski , Ashish Sabharwal

Despite the great success of Transformer networks in various applications such as natural language processing and computer vision, their theoretical aspects are not well understood. In this paper, we study the approximation and estimation…

Machine Learning · Computer Science 2024-03-26 Shokichi Takakura , Taiji Suzuki

Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization…

Formal Languages and Automata Theory · Computer Science 2015-09-25 Rayna Dimitrova , Rupak Majumdar

We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.…

Formal Languages and Automata Theory · Computer Science 2018-10-08 Alexandre Mansard

We define natural A_infinity-transformations and construct A_infinity-category of A_infinity-functors. The notion of non-strict units in an A_infinity-category is introduced. The 2-category of (unital) A_infinity-categories, (unital)…

Category Theory · Mathematics 2008-02-17 Volodymyr Lyubashenko

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina

We consider, in a string theory framework, physical processes of phenomenological interest in models with a low string scale. The amplitudes we study involve tree-level virtual gravitational exchange, divergent in a field-theoretical…

High Energy Physics - Theory · Physics 2011-07-19 E. Dudas , J. Mourad

Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…

Logic in Computer Science · Computer Science 2016-06-22 Michael Elberfeld , Marlin Frickenschmidt , Martin Grohe

We introduce a logic, called LT, to express properties of transductions, i.e. binary relations from input to output (finite) words. In LT, the input/output dependencies are modelled via an origin function which associates to any position of…

Formal Languages and Automata Theory · Computer Science 2018-05-31 Luc Dartois , Emmanuel Filiot , Nathan Lhote