相关论文: Iterative pushdown automata and hyperbolic contour…

In this paper, we propose a procedure that given an integer reset timed automaton (IRTA) ${\cal A}$, produces a language equivalent deterministic one clock IRTA ${\cal B}$ whose size is at most doubly exponential in the size of ${\cal A}$.…

We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach,…

The paper studies modular reduction techniques for abstract regular and chiral polytopes, with two purposes in mind: first, to survey the literature about modular reduction in polytopes; and second, to apply modular reduction, with moduli…

We propose iterative inversion algorithms for weighted Radon transforms $R_W$ along hyperplanes in $R^3$. More precisely, expandingthe weight $W = W (x, \theta), x \in R^3 , \theta \in S^2$ , into the series of spherical harmonics in…

Critical behavior of the Ising model is investigated at the center of large scale finite size systems, where the lattice is represented as the tiling of pentagons. The system is on the hyperbolic plane, and the recursive structure of the…

We explore the connections between automata, groups, limit spaces of self-similar actions, and tilings. In particular, we show how a group acting ``nicely'' on a tree gives rise to a self-covering of a topological groupoid, and how the…

We construct and study the unique random tiling of the hyperbolic plane into ideal hyperbolic triangles (with the three corners located on the boundary) that is invariant (in law) with respect to Moebius transformations, and possesses a…

We consider the projectivization of Minkowski space with the analytic continuation of the hyperbolic metric and call this an extended hyperbolic space. We can measure the volume of a domain lying across the boundary of the hyperbolic space…

Acting in human environments is a crucial capability for general-purpose robots, necessitating a robust understanding of natural language and its application to physical tasks. This paper seeks to harness the capabilities of diffusion…

We introduce a certain restriction of weighted automata over the rationals, called image-binary automata. We show that such automata accept the regular languages, can be exponentially more succinct than corresponding NFAs, and allow for…

We present a perturbed subspace iteration algorithm to approximate the lowermost eigenvalue cluster of an elliptic eigenvalue problem. As a prototype, we consider the Laplace eigenvalue problem posed in a polygonal domain. The algorithm is…

We cast new light on the existing models of one-way deterministic topological automata by introducing a fresh but general, convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a…

In this paper, we prove that the general problem of tiling the hyperbolic plane with \`a la Wang tiles is undecidable.

The hyperbolic Pascal triangle ${\cal HPT}_{4,q}$ $(q\ge5)$ is a new mathematical construction, which is a geometrical generalization of Pascal's arithmetical triangle. In the present study we show that a natural pattern of rows of ${\cal…

A typewriter automaton is a special variant of a two-dimensional automaton that receives two-dimensional words as input and is only capable of moving its input head through its input word in three directions: downward, leftward, and…

This paper is concerned with boundary stabilization of two-dimensional hyperbolic systems of partial differential equations. By adapting the Lyapunov function previously proposed by the second author for linearized hyperbolic systems with…

In a jumping finite automaton, the input head can jump to an arbitrary position within the remaining input after reading and consuming a symbol. We characterize the corresponding class of languages in terms of special shuffle expressions…

Vision Language Action (VLA) models have recently shown great potential in bridging multimodal perception with robotic control. However, existing methods often rely on direct fine-tuning of pre-trained Vision-Language Models (VLMs), feeding…

Manipulation tasks can often be decomposed into multiple subtasks performed in parallel, e.g., sliding an object to a goal pose while maintaining contact with a table. Individual subtasks can be achieved by task-axis controllers defined…

Hyperbolic manifolds for visual representation learning allow for effective learning of semantic class hierarchies by naturally embedding tree-like structures with low distortion within a low-dimensional representation space. The highly…