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

Designing and building automated systems with which people can interact naturally is one of the emerging objective of Mechatronics. In this perspective multimodality and adaptivity represent focal issues, enabling users to communicate more…

Word embeddings are useful for a wide variety of tasks, but they lack interpretability. By rotating word spaces, interpretable dimensions can be identified while preserving the information contained in the embeddings without any loss. In…

In this paper, we parametrize the space of isometric immersions of the hyperbolic plane into the hyperbolic 3-space in terms of null-causal curves in the space of oriented geodesics. Moreover, we characterize "ideal cones" (i.e., cones…

3D-aware visual pretraining has proven effective in improving the performance of downstream robotic manipulation tasks. However, existing methods are constrained to Euclidean embedding spaces, whose flat geometry limits their ability to…

This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless…

We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is important for reasoning about structures that use data values…

Recent efforts on training visual navigation agents conditioned on language using deep reinforcement learning have been successful in learning policies for different multimodal tasks, such as semantic goal navigation and embodied question…

We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.

Updatable timed automata (UTA) are extensions of classic timed automata that allow special updates to clock variables, like x:= x - 1, x := y + 2, etc., on transitions. Reachability for UTA is undecidable in general. Various subclasses with…

We generalize the concept of synchronizing words for finite automata, which map all states of the automata to the same state, to deterministic visibly push-down automata. Here, a synchronizing word w does not only map all states to the same…

In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author.

A spacetime domain can be progressively meshed by tent shaped objects. Numerical methods for solving hyperbolic systems using such tent meshes to advance in time have been proposed previously. Such schemes have the ability to advance in…

We propose the class of uniformly convex $W$-hyperbolic spaces with monotone modulus of uniform convexity ($UCW$-hyperbolic spaces for short) as an appropriate setting for the study of nonexpansive iterations. $UCW$-hyperbolic spaces are a…

Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…

We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history deterministic and 0-1 probabilistic. We show that every…

Different techniques to speed up quantum adiabatic processes are currently being explored for applications in atomic, molecular and optical physics, such as transport, cooling and expansions, wavepacket splitting, or internal state control.…

This paper presents an iterative scheme that converges to the solution of a pseudo-monotone variational inequality problem in the setting of $\mathbb{R}^{n}$. Traditional methods often require projections onto the feasible set…

The symmetric spaces that appear as moduli spaces in string theory and supergravity can be decomposed with explicit metrics using parabolic subgroups. The resulting isometry between the original moduli space and this decomposition can be…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

We formulate a new geometrical string on the euclidean lattice. It is possible to find such spin systems with local interaction which reproduce the same surface dynamics.In the three-dimensional case this spin system is a usual Ising…