Related papers: Finite-state transducers for substitution tilings
Recently, there has been an increasing interest in the formal analysis and design of control systems. In this area, in order to reduce the complexity and scale of control systems, finite abstractions of control systems are introduced and…
Mining and exploring databases should provide users with knowledge and new insights. Tiles of data strive to unveil true underlying structure and distinguish valuable information from various kinds of noise. We propose a novel Boolean…
We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular…
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…
Finite-state automata are a very effective tool in natural language processing. However, in a variety of applications and especially in speech precessing, it is necessary to consider more general machines in which arcs are assigned weights…
Engineering composite materials and devices with desired topological properties is accelerating the development of topological physics and its applications. Approaches of realizing novel topological hybrids, including in-situ epitaxy…
By transforming identification and control for nonlinear system into optimization problems, a novel optimization method named state transition algorithm (STA) is introduced to solve the problems. In the proposed STA, a solution to a…
Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…
The topological invariant of a topological insulator (or superconductor) is given by the number of symmetry-protected edge states present at the Fermi level. Despite this fact, established expressions for the topological invariant require…
Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently…
Tilting modules over commutative rings were recently classified in [12]: they correspond bijectively to faithful Gabriel topologies of finite type. In this note we extend this classification by dropping faithfulness. The counterpart of an…
This contribution belongs to a combinatorial approach to hyperbolic geometry and it is aimed at possible applications to computer simulations. It is based on the splitting method which was introduced by the author and which is reminded in…
Due to the growing request from modern wireless applications of cost-affordable and high-gain scanning antenna solutions, the design of large phased arrays (PAs) with radiating elements organized into modular clusters with sub-array-only…
The paper studies ways in which the sets of a partition of a lattice in $\RR^n$ become regular model sets. The main theorem gives equivalent conditions which assure that a matrix substitution system on a lattice in $\RR^n$ gives rise to…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
Techniques of producing new combinatorial structures from old ones are commonly called trades. The switching principle applies for a broad class of designs: it is a local transformation that modifies two columns of the incidence matrix. In…
A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…