Related papers: Aperiodic String Transducers
We study the $N=2$ string with a real structure on the $(2,2)$ spacetime, using BRST methods. Several new features emerge. In the diagonal basis, the operator $\exp(\lambda \int^z J^{\rm tot})$, which is associated with the moduli for the…
The nonlinear Fourier transform has the potential to overcome limits on performance and achievable data rates which arise in modern optical fiber communication systems when nonlinear interference is treated as noise. The periodic nonlinear…
This paper introduces a novel Token-and-Duration Transducer (TDT) architecture for sequence-to-sequence tasks. TDT extends conventional RNN-Transducer architectures by jointly predicting both a token and its duration, i.e. the number of…
Cross-domain shifts present a significant challenge for decision transformer (DT) policies. Existing cross-domain policy adaptation methods typically rely on a single simple filtering criterion to select source trajectory fragments and…
We generalize an efficient automata-based approach to string constraint solving, the stabilization-based method behind the solver Z3-Noodler, to support relational constraints represented by finite-state transducers (useful, for example,…
When the steady states at infinity become unstable through a pattern forming bifurcation, a travelling wave may bifurcate into a modulated front which is time-periodic in a moving frame. This scenario has been studied by B.Sandstede and…
It has been proposed that Randall-Sundrum models can be holographically described by a regularized (broken) conformal field theory. We analyze the foundations of this duality using a regularized version of the AdS/CFT correspondence. We…
The crossing property is perhaps the most subtle aspect of the particle-field relation. Although it is not difficult to state its content in terms of certain analytic properties relating different matrixelements of the S-matrix or…
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of "invisible" pebbles (as opposed to the usual "visible" ones). The resulting pebble tree automata recognize the regular…
Using end-to-end models for speech translation (ST) has increasingly been the focus of the ST community. These models condense the previously cascaded systems by directly converting sound waves into translated text. However, cascaded models…
Graph signal processing (GSP) advances spectral analysis on irregular domains. However, existing two-dimensional graph fractional Fourier transform (2D-GFRFT) employs a single fractional order for both factor graphs, thereby limiting its…
We define two classes of functions, called regular (respectively, first-order) list functions, which manipulate objects such as lists, lists of lists, pairs of lists, lists of pairs of lists, etc. The definition is in the style of regular…
We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation on the representations of two…
Simultaneous Machine Translation (SiMT) generates translation while reading source tokens, essentially producing the target prefix based on the source prefix. To achieve good performance, it leverages the relationship between source and…
Connections between nodes of fully connected neural networks are usually represented by weight matrices. In this article, functional transfer matrices are introduced as alternatives to the weight matrices: Instead of using real weights, a…
We take the first step in extending the integrability approach to one-point functions in AdS/dCFT to higher loop orders. More precisely, we argue that the formula encoding all tree-level one-point functions of SU(2) operators in the defect…
In this paper we investigate the action of self-consistent transfer operators (STOs) on Birkhoff cones and give sufficient conditions for stability of their fixed points. Our approach relies on the order preservation properties of STOs that…
Transformers in their common form are inherently limited to operate on whole token sequences rather than on one token at a time. Consequently, their use during online inference on time-series data entails considerable redundancy due to the…
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a term rewriting system (TRS) in such a way…
The one-dimensional transverse field Ising model is solved by continuous unitary transformations in the high-field limit. A high accuracy is reached due to the closure of the relevant algebra of operators which we call string operators. The…