English
Related papers

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

200 papers

The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling has derived a…

Formal Languages and Automata Theory · Computer Science 2011-03-10 Petr Jancar

The Kleene star operator is an important pattern construct for representing a pattern that repeats multiple times. Due to its simplicity and usefulness, it is imported into various pattern-matching systems other than regular expressions.…

Programming Languages · Computer Science 2018-09-11 Satoshi Egi

Higher-dimensional automata (HDA) are a formalism to faithfully model the behaviour of concurrent systems. For ordinary automata, there is a correspondence between regular expressions, regular languages and finite automata, which provides a…

Formal Languages and Automata Theory · Computer Science 2025-05-20 Henning Basold , Thomas Baronner , Márton Hablicsek

Given a self-adjoint operator H, a self-adjoint trace class operator V and a fixed Hilbert-Schmidt operator F with trivial kernel and co-kernel, using limiting absorption principle an explicit set of full Lebesgue measure is defined such…

Spectral Theory · Mathematics 2018-12-21 Nurulla Azamov

Automatic speech recognition (ASR) systems developed in recent years have shown promising results with self-attention models (e.g., Transformer and Conformer), which are replacing conventional recurrent neural networks. Meanwhile, a…

Sound · Computer Science 2022-11-01 Koichi Miyazaki , Masato Murata , Tomoki Koriyama

This paper introduces to the finite-state calculus a family of directed replace operators. In contrast to the simple replace expression, UPPER -> LOWER, defined in Karttunen (ACL-95), the new directed version, UPPER @-> LOWER, yields an…

cmp-lg · Computer Science 2008-02-03 Lauri Karttunen

Transducers generalise automata by producing output word(s) for each input word, thereby defining a relation over words. A transducer is said to be finite-valued if, for every input word, it produces at most $k$ output words, for some…

Formal Languages and Automata Theory · Computer Science 2026-05-08 Prince Mathew , Saina Sunny

Utilizing air-traffic control (ATC) data for downstream natural-language processing tasks requires preprocessing steps. Key steps are the transcription of the data via automatic speech recognition (ASR) and speaker diarization, respectively…

Computation and Language · Computer Science 2024-06-21 Alexander Blatt , Aravind Krishnan , Dietrich Klakow

Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms for composing two-way transducers cause a double exponential…

Formal Languages and Automata Theory · Computer Science 2017-02-24 Luc Dartois , Paulin Fournier , Ismaël Jecker , Nathan Lhote

This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomial (and not just linear) growth. The class has four…

Formal Languages and Automata Theory · Computer Science 2018-10-23 Mikołaj Bojańczyk

We study Schr\"odinger operators on the real line whose potentials are generated by an underlying ergodic subshift over a finite alphabet and a rule that replaces symbols by compactly supported potential pieces. We first develop the…

Spectral Theory · Mathematics 2015-06-12 David Damanik , Jake Fillman , Anton Gorodetski

We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…

Functional Analysis · Mathematics 2016-07-14 Calvin Hotchkiss , Eric S. Weber

While spike trains are obviously not band-limited, the theory of super-resolution tells us that perfect recovery of unknown spike locations and weights from low-pass Fourier transform measurements is possible provided that the minimum…

Information Theory · Computer Science 2016-11-18 Céline Aubel , David Stotz , Helmut Bölcskei

This paper presents the rigorous mathematical construction and foundational properties of the Divergence-Free Radiant Transform (DFRT), a spectral transform specifically designed for divergence-free vector fields, with applications in…

Analysis of PDEs · Mathematics 2025-07-15 Zachary Mullaghy

In this article we extend B. Simon's construction and results for leading order eigenvalue asymptotics to $n$-dimensional Schr\"odinger operators with non-confining potentials given by: $H^\alpha_n=-\Delta +\prod\limits_{i=1}^n…

Spectral Theory · Mathematics 2015-04-22 Nils Rautenberg , Brice Camus

We present a new asynchronous model of computation named Stellar Resolution based on first-order unification. This model of computation is obtained as a formalisation of Girard's transcendental syntax programme, sketched in a series of…

Logic in Computer Science · Computer Science 2020-08-03 Boris Eng , Thomas Seiller

Based on two trivial observations of the AEC industry, this paper proposes a traversal method ("S-rule") and expression ("1-dimensional-graph") transformed from DFS. This traversal method conforms to the original cognitive logic of the AEC…

Combinatorics · Mathematics 2023-08-15 Luxin Luo , Sida Kong

Encoder-decoder models have made great progress on handwritten mathematical expression recognition recently. However, it is still a challenge for existing methods to assign attention to image features accurately. Moreover, those…

Computer Vision and Pattern Recognition · Computer Science 2021-05-18 Wenqi Zhao , Liangcai Gao , Zuoyu Yan , Shuai Peng , Lin Du , Ziyin Zhang

It is critical to obtain high resolution features with long range dependency for dense prediction tasks such as semantic segmentation. To generate high-resolution output of size $H\times W$ from a low-resolution feature map of size $h\times…

Computer Vision and Pattern Recognition · Computer Science 2022-01-25 Ying Wang , Chiuman Ho , Wenju Xu , Ziwei Xuan , Xudong Liu , Guo-Jun Qi

We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…

General Mathematics · Mathematics 2025-07-08 Stanislav Semenov
‹ Prev 1 4 5 6 7 8 10 Next ›