English
Related papers

Related papers: Iterative pushdown automata and hyperbolic contour…

200 papers

Cross-lingual word embeddings can be applied to several natural language processing applications across multiple languages. Unlike prior works that use word embeddings based on the Euclidean space, this short paper presents a simple and…

Computation and Language · Computer Science 2022-06-28 Chandni Saxena , Mudit Chaudhary , Helen Meng

We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-visible alphabet) using a common deterministic transition…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Olivier Gauwin , Anca Muscholl , Michael Raskin

We show that deterministic collapsible pushdown automata of second order can recognize a language that is not recognizable by any deterministic higher-order pushdown automaton (without collapse) of any order. This implies that there exists…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Paweł Parys

This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the…

Geometric Topology · Mathematics 2014-10-01 Taiyo Inoue

A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various…

Computational Complexity · Computer Science 2007-07-04 Peter Gaži , Branislav Rovan

Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three…

Formal Languages and Automata Theory · Computer Science 2016-06-02 Luc Dartois , Emmanuel Filiot , Pierre-Alain Reynier , Jean-Marc Talbot

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. As trees and more generally hedges can be…

Formal Languages and Automata Theory · Computer Science 2013-11-25 Mathieu Caralp , Emmanuel Filiot , Pierre-Alain Reynier , Frédéric Servais , Jean-Marc Talbot

We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…

Formal Languages and Automata Theory · Computer Science 2024-08-07 Mikołaj Bojańczyk , Joanna Fijalkow , Bartek Klin , Joshua Moerman

One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL. In this paper, we consider the application of OCATA to the problems of model-checking and…

Logic in Computer Science · Computer Science 2014-06-18 Thomas Brihaye , Morgane Estiévenart , Gilles Geeraerts

Localization and dilation procedures are discussed for infinite dimensional $\alpha$-concave measures on abstract locally convex spaces (following Borell's hierarchy of hyperbolic measures).

Probability · Mathematics 2014-05-14 Sergey G. Bobkov , James Melbourne

Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an…

Formal Languages and Automata Theory · Computer Science 2012-08-27 Tomáš Masopust

We use a special tiling for the hyperbolic $d$-space $\mathbb{H}^d$ for $d=2,3,4$ to construct an (almost) explicit isomorphism between the Lipschitz-free space $\mathcal{F}(\mathbb{H}^d)$ and $\mathcal{F}(P)\oplus\mathcal{F}(\mathcal{N})$…

Functional Analysis · Mathematics 2026-01-14 Christian Bargetz , Franz Luggin , Tommaso Russo

In the classic problem of sequence prediction, a predictor receives a sequence of values from an emitter and tries to guess the next value before it appears. The predictor masters the emitter if there is a point after which all of the…

Formal Languages and Automata Theory · Computer Science 2016-03-09 Tim Smith

In this paper we describe an iterative operator-splitting method for unbounded operators. We derive error bounds for iterative splitting methods in the presence of unbounded operators and semigroup operators. Here mixed applications of…

Numerical Analysis · Mathematics 2009-04-02 Juergen Geiser

Natural language text exhibits hierarchical structure in a variety of respects. Ideally, we could incorporate our prior knowledge of this hierarchical structure into unsupervised learning algorithms that work on text data. Recent work by…

Computation and Language · Computer Science 2018-06-13 Bhuwan Dhingra , Christopher J. Shallue , Mohammad Norouzi , Andrew M. Dai , George E. Dahl

Spherical means are well-known useful tool in the theory of partial differential equations with applications to solving hyperbolic and ultrahyperbolic equations and problems of integral geometry, tomography and Radon transforms. We…

Classical Analysis and ODEs · Mathematics 2016-10-17 E. L. Shishkina , S. M. Sitnik

Deformable object manipulation remains a key challenge in developing autonomous robotic systems that can be successfully deployed in real-world scenarios. In this work, we explore the challenges of deformable object manipulation through the…

Robotics · Computer Science 2025-03-05 Alison Bartsch , Amir Barati Farimani

This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…

Geometric Topology · Mathematics 2007-05-23 Howard A. Masur , Yair N. Minsky

In this paper we define an infinite family of triangular tilings of the hyperbolic plane defined by two parameters ranging in the natural nummbers and we give a uniform way to define coordinates for locating the triangles of the tiling.

Formal Languages and Automata Theory · Computer Science 2011-01-04 Maurice Margenstern

We study the iterated limit of a quaternary of means of four terms through the period map from the family of cyclic fourfold coverings of the complex projective line branching at six points to the three-dimensional complex ball…

Algebraic Geometry · Mathematics 2026-04-21 Keiji Matsumoto , Ryunosuke Nakano