Related papers: Iterative pushdown automata and hyperbolic contour…
We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not…
Recently, Haase and Ilten initiated the study of classifying algebraically hyperbolic surfaces in toric threefolds. We complete this classification for $\mathbb{P}^1 \times \mathbb{P}^1 \times \mathbb{P}^1$, $\mathbb{P}^2 \times…
The paper discusses the problem of determinising finite-state automata containing large numbers of epsilon-moves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very…
Several articles deal with tilings with squares and dominoes of the well-known regular square mosaic in Euclidean plane, but not any with the hyperbolic regular square mosaics. In this article, we examine the tiling problem with colored…
Metamaterials and metasurfaces are designed by periodically arranged subwavelength geometries, allowing a tailored manipulation of the electromagnetic response of matter. Here, we exploit temporal variations of permittivity inside…
We present an iterative coupling scheme for the numerical approximation of the mixed hyperbolic-parabolic system of fully dynamic poroelasticity. We prove its convergence in the Banach space setting for an abstract semi-discretization in…
We extend to the context of hyperbolic 3-manifolds with geodesic boundary Thurston's approach to hyperbolization by means of geometric triangulations. In particular, we introduce moduli for (partially) truncated hyperbolic tetrahedra, and…
This paper is about reachability analysis in a restricted subclass of multi-pushdown automata. We assume that the control states of an automaton are partially ordered, and all transitions of an automaton go downwards with respect to the…
A dynamic iteration scheme for linear infinite-dimensional port-Hamiltonian systems is proposed. The dynamic iteration is monotone in the sense that the error is decreasing, it does not require any stability condition and is in particular…
Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
Motivated by the recent emergence of a new class of anisotropic 2D materials, we examine their electromagnetic modes and demonstrate that a broad class of the materials can host highly directional hyperbolic plasmons. Their propagation…
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
Effective planning of long-horizon deformable object manipulation requires suitable abstractions at both the spatial and temporal levels. Previous methods typically either focus on short-horizon tasks or make strong assumptions that…
Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph,…
Word alignment over parallel corpora has a wide variety of applications, including learning translation lexicons, cross-lingual transfer of language processing tools, and automatic evaluation or analysis of translation outputs. The great…
We present how to physically realize the auxiliary source described in the recently introduced active plasmon injection loss compensation scheme for enhanced near-field superlensing. Particularly, we show that the characteristics of the…
We show that all hyperbolic surfaces admit an ideal triangulation with bounded shear parameters. This upper bound depends logarithmically on the topology of the surface.
When their reading heads are allowed to move completely asynchronously, finite-state automata with multiple tapes achieve a significant expressive power, but also lose useful closure properties---closure under intersection, in particular.…