相关论文: Iterative pushdown automata and hyperbolic contour…
This survey article describes the algorithmic approaches successfully used over the time to construct hyperbolic structures on 3-dimensional topological "objects" of various types, and to classify several classes of such objects using such…
We discuss the art and science of producing conformally correct euclidean and hyperbolic tilings of compact surfaces. As an example, we present a tiling of the Chmutov surface by hyperbolic (2, 4, 6) triangles.
In this paper, we try to give the appropriate class of languages to which belong various objects associated with tessellations in the hyperbolic plane.
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean…
In this paper, we develop the mathematical tools needed to explore isotopy classes of tilings on hyperbolic surfaces of finite genus, possibly nonorientable, with boundary, and punctured. More specifically, we generalize results on…
We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term…
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access…
Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive…
We contribute results for a set of fundamental problems in the context of programmable matter by presenting algorithmic methods for evaluating and manipulating a collective of particles by a finite automaton that can neither store…
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple…
We choose random points in the hyperbolic disc and claim that these points are already word representations. However, it is yet to be uncovered which point corresponds to which word of the human language of interest. This correspondence can…
Jumping automata are finite automata that read their input in a non-consecutive manner, disregarding the order of the letters in the word. We introduce and study jumping automata over infinite words. Unlike the setting of finite words,…
We consider infinite-state Attacker-Defender games with reachability objectives. The results of the paper are twofold. Firstly we prove a new language-theoretic result for weighted automata on infinite words and show its encoding into the…
We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of advised finite automata. The existence of an infinite…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
Input-driven pushdown automata (also known as visibly pushdown automata and as nested word automata) are a subclass of deterministic pushdown automata and a superclass of the parenthesis languages. Nguyen and Ogawa ("Event-clock visibly…
From condensed matter to quantum chromodynamics, multidimensional spins are a fundamental paradigm, with a pivotal role in combinatorial optimization and machine learning. Machines formed by coupled parametric oscillators can simulate spin…
We will consider iteration of an analytic self-map $f$ of the unit ball in $\mathbb{C}^N$. Many facts were established about such dynamics in the 1-dimensional case (i.e. for self-maps of the unit disk), and we will generalize some of them…
In this paper, we remind previous results about the tilings $\{p,q\}$ of the hyperbolic plane. We introduce two new ways to split the hyperbolic plane in order to algorithmically construct the tilings $\{p,q\}$ when $q$ is odd.
In this paper, the Mean value iterative process is modified with the Mann iterative process for mean nonexpansive mapping in a hyperbolic metric space that satisfy the symmetry criteria and in uniformly convex hyperbolic spaces to validate…