Related papers: SD-Regular Transducer Expressions for Aperiodic Tr…
One-point functions of certain non-protected scalar operators in the defect CFT dual to the D3-D5 probe brane system with k units of world volume flux can be expressed as overlaps between Bethe eigenstates of the Heisenberg spin chain and a…
Call a string-to-string transducer regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. This paper proposes to…
Persistence of stationary and traveling single-humped localized solutions in the spatial discretizations of the nonlinear Schrodinger (NLS) equation is addressed. The discrete NLS equation with the most general cubic polynomial function is…
As commonly used implicit geometry representations, the signed distance function (SDF) is limited to modeling watertight shapes, while the unsigned distance function (UDF) is capable of representing various surfaces. However, its inherent…
The transducer synthesis problem on finite words asks, given a specification $S \subseteq I \times O$, where $I$ and $O$ are sets of finite words, whether there exists an implementation $f: I \rightarrow O$ which (1) fulfils the…
Deep generative models have been enjoying success in modeling continuous data. However it remains challenging to capture the representations for discrete structures with formal grammars and semantics, e.g., computer programs and molecular…
Speech applications dealing with conversations require not only recognizing the spoken words, but also determining who spoke when. The task of assigning words to speakers is typically addressed by merging the outputs of two separate…
Selective state-space models (SSMs) are an emerging alternative to the Transformer, offering the unique advantage of parallel training and sequential inference. Although these models have shown promising performance on a variety of tasks,…
(abridged) We develop a tool for the automated spectral classification of OB stars according to their sub-types. We use the regular Random Forest (RF) algorithm, the Probabilistic RF (PRF), and we introduce the KDE-RF method which is a…
We prove that the so-called first trace formula holds for all Schr\"odinger operators on the line with real-valued integrable potentials.
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to languages accepted by permutation automata: union, quotient, complement,…
This paper deals with the realisation of affine constraints on nonreversible stochastic differential equations (SDE) by strong confining forces. We prove that the confined dynamics converges pathwise and on bounded time intervals to the…
Transformer models have achieved superior performance in various natural language processing tasks. However, the quadratic computational cost of the attention mechanism limits its practicality for long sequences. There are existing…
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…
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…
Neural transducers have been widely used in automatic speech recognition (ASR). In this paper, we introduce it to streaming end-to-end speech translation (ST), which aims to convert audio signals to texts in other languages directly.…
A class of scalar Stieltjes like functions is realized as linear-fractional transformations of transfer functions of conservative systems based on a Schr\"odinger operator T_h in $L_2[a,+\infty)$ with a non-selfadjoint boundary condition.…
The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup…
A Sturmian sequence is an infinite nonperiodic string over two letters with minimal subword complexity. In two papers, the first written by Morse and Hedlund in 1940 and the second by Coven and Hedlund in 1973, a surprising correspondence…
This letter proposes a fast implementation of the regularity-constrained discrete sine transform (R-DST). The original DST \textit{leaks} the lowest frequency (DC: direct current) components of signals into high frequency (AC: alternating…