相关论文: Pushdown dimension
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal…
In Statistical Learning, the Vapnik-Chervonenkis (VC) dimension is an important combinatorial property of classifiers. To our knowledge, no theoretical results yet exist for the VC dimension of edited nearest-neighbour (1NN) classifiers…
A new homological dimension is introduced to measure the quality of resolutions of `singular' finite dimensional algebras (of infinite global dimension) by `regular' ones (of finite global dimension). Upper bounds are established in terms…
In a recent arXiv-manuscript Fox studies infinite subtraction games with a finite (ternary) and aperiodic Sprague-Grundy function. Here we provide an elementary example of a game with the given properties, namely the game given by the…
The squashed entanglement is a widely used entanglement measure that has many desirable properties. However, as it is based on an optimization over extensions of arbitrary dimension, one drawback of this measure is the lack of good…
We develop the hypothesis that the dynamics of a given system may lead to the activity being constricted to a subset of space, characterized by a fractal dimension smaller than the space dimension. We also address how the response function…
A classical approach to formal policy synthesis in stochastic dynamical systems is to construct a finite-state abstraction, often represented as a Markov decision process (MDP). The correctness of these approaches hinges on a behavioural…
A two-dimensional automaton operates on arrays of symbols. While a standard (four-way) two-dimensional automaton can move its input head in four directions, restricted two-dimensional automata are only permitted to move their input heads in…
Timed pushdown automata (TPDA) are an expressive formalism combining recursion with a rich logic of timing constraints. We prove that reachability relations of TPDA are expressible in linear arithmetic, a rich logic generalising Presburger…
The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…
This chapter explores the notion of "dimension" of a set. Various power laws by which an Euclidean space can be characterized are used to define dimensions, which then explore different aspects of the set. Also discussed are the…
The signaling dimension of any given physical system represents its classical simulation cost, that is, the minimum dimension of a classical system capable of reproducing all the input/output correlations of the given system. The signaling…
We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…
The study of combinatorial games is intimately tied to the study of graphs, as any game can be realized as a directed graph in which players take turns traversing the edges until reaching a sink. However, there have heretofore been few…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
We introduce and study the spherical dimension, a natural topological relaxation of the VC dimension that unifies several results in learning theory where topology plays a key role in the proofs. The spherical dimension is defined by…
Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can be constrained by boundaries and…
We study termination time and recurrence time in programs with unbounded recursion, which are either randomized or operate on some statistically quantified inputs. As the underlying formal model for such programs we use probabilistic…
In the theory of games on infinite-state arenas, there is a stark contrast between (i) recursion-based models such as pushdown systems and extensions on one hand, and (ii) counter-based models like vector addition systems with states (VASS)…
Du, Kakade, Wang, and Yang recently established intriguing lower bounds on sample complexity, which suggest that reinforcement learning with a misspecified representation is intractable. Another line of work, which centers around a…