English
Related papers

Related papers: SD-Regular Transducer Expressions for Aperiodic Tr…

200 papers

A deterministic finite automaton is directable if it has a directing word which takes the automaton from every state to the same state. These notions have been extended also to other kinds of automata. Thus, B.~Imreh and M.~Steinby (1999)…

Formal Languages and Automata Theory · Computer Science 2021-03-02 Magnus Steinby

We establish strong well-posedness for a class of degenerate SDEs of kinetic type with autonomous diffusion driven by a symmetric $\alpha$-stable process under H\"older regularity conditions for the drift term. We partially recover the…

Probability · Mathematics 2025-07-11 Giacomo Lucertini , Stéphane Menozzi , Stefano Pagliarani

We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density…

Statistics Theory · Mathematics 2013-05-10 Victor M. Panaretos , Shahin Tavakoli

We investigate dense output formulae (also known as continuous extensions) for strong stability preserving (SSP) Runge-Kutta methods. We require that the dense output formula also possess the SSP property, ideally under the same step-size…

Numerical Analysis · Mathematics 2016-11-16 David I. Ketcheson , Lajos Lóczi , Aliya Jangabylova , Adil Kusmanov

Nonlinear filtering with correlated noise leads to a Duncan-Mortensen-Zakai (DMZ) equation in the form of a stochastic partial differential equation (SPDE). Unlike the independent noise case, the presence of correlation prevents the…

Numerical Analysis · Mathematics 2026-05-26 Yuhua Meng , Stephen S. -T. Yau , Zhiwen Zhang

Although state-of-the-art classifiers for facial expression recognition (FER) can achieve a high level of accuracy, they lack interpretability, an important feature for end-users. Experts typically associate spatial action units (AUs) from…

Computer Vision and Pattern Recognition · Computer Science 2024-10-04 Soufiane Belharbi , Marco Pedersoli , Alessandro Lameiras Koerich , Simon Bacon , Eric Granger

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…

Formal Languages and Automata Theory · Computer Science 2018-03-19 Mikolaj Bojanczyk , Laure Daviaud , Krishna Shankara Narayanan

We obtain a new explicit expression for the noncommutative (star) product on the fuzzy two-sphere which yields a unitary representation. This is done by constructing a star product, $\star_{\lambda}$, for an arbitrary representation of…

High Energy Physics - Theory · Physics 2014-11-18 K. Hayasaka , R. Nakayama , Y. Takaya

Automatic differentiation (AD) aims to compute derivatives of user-defined functions, but in Turing-complete languages, this simple specification does not fully capture AD's behavior: AD sometimes disagrees with the true derivative of a…

Programming Languages · Computer Science 2021-12-07 Alexander K. Lew , Mathieu Huot , Vikash K. Mansinghka

In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we focused on the study of Hasse diagram generators, i.e., slice…

Formal Languages and Automata Theory · Computer Science 2012-06-27 Mateus de Oliveira Oliveira

We discuss discrete one-dimensional Schr\"odinger operators whose potentials are generated by an invertible ergodic transformation of a compact metric space and a continuous real-valued sampling function. We pay particular attention to the…

Spectral Theory · Mathematics 2009-05-15 Jon Chaika , David Damanik , Helge Krueger

This paper explores the fine-grained structure of classes of regular languages maintainable in fragments of first-order logic within the dynamic descriptive complexity framework of Patnaik and Immerman. A result by Hesse states that the…

Logic in Computer Science · Computer Science 2026-01-27 Corentin Barloy , Felix Tschirbs , Nils Vortmeier , Thomas Zeume

Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…

Logic in Computer Science · Computer Science 2017-06-14 Marco Voigt

Multi-terminal transport setups allow to realize more complex measurements and functionalities (e.g., transistors) of nanoscale systems than the simple two-terminal arrangement. Here the steady-state density functional formalism (i-DFT) for…

Mesoscale and Nanoscale Physics · Physics 2019-08-14 Stefan Kurth , David Jacob , Nahual Sobrino , Gianluca Stefanucci

We introduce a framework for automatic differentiation with weighted finite-state transducers (WFSTs) allowing them to be used dynamically at training time. Through the separation of graphs from operations on graphs, this framework enables…

Machine Learning · Computer Science 2020-10-05 Awni Hannun , Vineel Pratap , Jacob Kahn , Wei-Ning Hsu

We consider a class of stochastic reaction-diffusion equations also having a stochastic perturbation on the boundary and we show that when the diffusion rate is much larger than the rate of reaction, it is possible to replace the SPDE by a…

Probability · Mathematics 2010-12-16 Sandra Cerrai , Mark Freidlin

We study the spectral properties of Schr\"{o}dinger operators on perturbed lattices. We shall prove the non-existence or the discreteness of embedded eigenvalues, the limiting absorption principle for the resolvent, construct a spectral…

Spectral Theory · Mathematics 2024-03-26 Kazunori Ando , Hiroshi Isozaki , Hisashi Morioka

String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure. Here we elaborate this…

Logic in Computer Science · Computer Science 2017-01-11 Joost Engelfriet , Hendrik Jan Hoogeboom

In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by…

Formal Languages and Automata Theory · Computer Science 2017-06-28 Emmanuel Filiot , Nicolas Mazzocchi , Jean-François Raskin

We present a detailed study of spectrally flowed four-point functions in the SL(2,$\mathbb{R}$) WZW model, focusing on their conformal block decomposition. Dei and Eberhardt conjectured a general formula relating these observables to their…

High Energy Physics - Theory · Physics 2024-06-07 Sergio Iguri , Nicolas Kovensky , Julian H. Toro