English
Related papers

Related papers: Pushdown dimension

200 papers

This note shows that some assumption on small balls probability, frequently used in the domain of functional statistics, implies that the considered functional space is of finite dimension. To complete this result an example of L2 process…

Statistics Theory · Mathematics 2012-12-06 Jean-Marc Azais , Jean-Claude Fort

Algorithmic contract design studies scenarios where a principal incentivizes an agent to exert effort on her behalf. In this work, we focus on settings where the agent's type is drawn from an unknown distribution, and formalize an offline…

Computer Science and Game Theory · Computer Science 2025-01-27 Paul Duetting , Michal Feldman , Tomasz Ponitka , Ermis Soumalias

We study variants of a stochastic game inspired by backgammon where players may propose to double the stake, with the game state dictated by a one-dimensional random walk. Our variants allow for different numbers of proposals and different…

Optimization and Control · Mathematics 2024-10-28 Haoru Ju , Daniel Leifer , Steven J. Miller , Sooraj A. Padmanabhan , Chenyang Sun , Luke Tichi , Benjamin Tocher , Kiley Wallace

Finite-state dimension quantifies the asymptotic rate of information in an infinite sequence as perceived by finite automata. For a fixed alphabet, the infinite sequences that have maximal finite-state dimension are exactly those that are…

Information Theory · Computer Science 2025-10-22 Laurent Bienvenu , Hugo Gimbert , Subin Pulari

A very large extra dimension may contain many localized branes. We discuss the possibility to formulate such models as a spin system where each spin indicates the supersymmetry direction preserved by the corresponding brane. In the…

High Energy Physics - Phenomenology · Physics 2014-11-20 Karim Benakli

Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all…

Probability · Mathematics 2025-02-03 Jacopo Borga , Andrew Lin

We study an expressive model of timed pushdown automata extended with modular and fractional clock constraints. We show that the binary reachability relation is effectively expressible in hybrid linear arithmetic with a rational and an…

Formal Languages and Automata Theory · Computer Science 2018-05-01 Lorenzo Clemente , Sławomir Lasota

Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other words, there are outcome sequences x where an effectively…

Logic · Mathematics 2022-01-19 George Barmpalias , Lu Liu

The properties of a one space-dimension, one particle dynamical system under the influence of a purely dissipative force are investigated. Assuming this force depends only on the velocity, it is demonstrated, in contrast to the case of…

Computational Physics · Physics 2014-05-19 Ronald E. Mickens , Kale Oyedeji

The strength of a dynamic language is also its weakness: run-time flexibility comes at the cost of compile-time predictability. Many of the hallmarks of dynamic languages such as closures, continuations, various forms of reflection, and a…

Programming Languages · Computer Science 2014-08-18 J. Ian Johnson , David Van Horn

We develop the theory of the additive dimension ${\rm dim} (A)$, i.e. the size of a maximal dissociated subset of a set $A$. It was shown that the additive dimension is closely connected with the growth of higher sumsets $nA$ of our set…

Combinatorics · Mathematics 2022-05-17 Ilya D. Shkredov

We develop a variational principle for mean dimension with potential of $\mathbb{R}^d$-actions. We prove that mean dimension with potential is bounded from above by the supremum of the sum of rate distortion dimension and a potential term.…

Dynamical Systems · Mathematics 2023-10-09 Masaki Tsukamoto

There is growing effort in the "physics of behavior" that aims at complete quantitative characterization of animal movements under more complex, naturalistic conditions. One reaction to the resulting explosion of data is the search for low…

Neurons and Cognition · Quantitative Biology 2024-01-23 William Bialek

Parallel communicating systems of pushdown automata (PCPA) were introduced in (Csuhaj-Varj{\'u} et. al. 2000) and in their centralized variants shown to be able to simulate nondeterministic one-way multi-head pushdown automata. A claimed…

Formal Languages and Automata Theory · Computer Science 2014-08-07 Holger Petersen

In this work, we introduce the notion of product gales, which is the modification of an $s$-gale such that $k$ separate bets can be placed at each symbol. The product of the bets placed are taken into the capital function of the…

Information Theory · Computer Science 2025-02-11 Akhil S

We shall define a general notion of dimension, and study groups and rings whose interpretable sets carry such a dimensio. In particular, we deduce chain conditions for groups, definability results for fields and domains, and show that…

Logic · Mathematics 2019-09-04 Frank Olaf Wagner

Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of…

Formal Languages and Automata Theory · Computer Science 2014-02-28 Parosh Aziz Abdulla , Mohamed Faouzi Atig , Jari Stenman

We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…

Combinatorics · Mathematics 2017-07-05 Viktor L. Ginzburg , Dmitrii V. Pasechnik

During the last decades, classical models in language theory have been extended by control mechanisms defined by monoids. We study which monoids cause the extensions of context-free grammars, finite automata, or finite state transducers to…

Formal Languages and Automata Theory · Computer Science 2011-03-18 Georg Zetzsche

Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…

Machine Learning · Computer Science 2023-07-25 Bernhard Ganter , Tom Hanika , Johannes Hirth