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

We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata…

Hyperbolic spaces have recently gained momentum in the context of machine learning due to their high capacity and tree-likeliness properties. However, the representational power of hyperbolic geometry is not yet on par with Euclidean…

In (DLT 2016) we studied timed context sensitive languages characterized by multiple stack push down automata (MPA), with an explicit bound on number of stages where in each stage at most one stack is used (k-round MPA). In this paper, we…

A comprehensive analysis of hybrid TM-TE polarized surface electromagnetic waves supported by different few-layer anisotropic metasurfaces is presented. A generalized 4$\times$4 T-matrix formalism for arbitrary anisotropic 2D layers is…

We study non-autonomous conformal iterated function systems, with finite or countably infinite alphabet alike. These differ from the usual (autonomous) iterated function systems in that the contractions applied at each step in time are…

In this article we study commutant lifting, more generally intertwining lifting, for different reproducing kernel Hilbert spaces over two domains in $\mathbb{C}^n$, namely the unit ball and the unit polydisc. The reproducing kernel Hilbert…

A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…

In this paper, we look at the improvement of our knowledge on a family of tilings of the hyperbolic plane which is brought in by the use of Sergeyev's numeral system based on grossone. It appears that the information we can get by using…

The question if a deterministic finite automaton admits a software reset in the form of a so-called synchronizing word can be answered in polynomial time. In this paper, we extend this algorithmic question to deterministic automata beyond…

Two features desired in a three-dimensional (3D) optical tomographic image reconstruction algorithm are the ability to reduce imaging artifacts and to do fast processing of large data volumes. Traditional iterative inversion algorithms are…

We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…

In a recent paper, Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller…

We give a diameter bound for fundamental domains for isometric actions of the fundamental group of a closed hyperbolic surface on a delta-hyperbolic space, where the bound depends on the hyperbolicity constant delta, the genus of the…

In $\mathbb{R}^3$, a hyperbolic paraboloid is a classical saddle-shaped quadric surface. Recently, Elser has modeled problems arising in Deep Learning using rectangular hyperbolic paraboloids in $\mathbb{R}^n$. Motivated by his work, we…

We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete…

In this paper we address some problems concerning an approximate Dirichlet domain. We show that under some assumptions the approximate Dirichlet domain can work equally well as an exact Dirichlet domain. In particular, we consider a problem…

See math.CV/0509030 which replaces this paper.

This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…

A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.

We study weakly hyperbolic iterated function systems on compact spaces, as defined by Edalat, but in the more general setting of a compact parameter space. We prove the existence of attractors, both in the topological and measure…