Related papers: Elementary fractal geometry. 4. Automata-generated…
Automatic generation of level maps is a popular form of automatic content generation. In this study, a recently developed technique employing the {\em do what's possible} representation is used to create open-ended level maps. Generation of…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.
Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract…
We introduce local iterated function systems and present some of their basic properties. A new class of local attractors of local iterated function systems, namely local fractal functions, is constructed. We derive formulas so that these…
We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and quantum circuits are naturally interpretable in such structures. We…
For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…
We study the topology of a class of proper submodules and some of its distinguished subclasses and call them structure spaces. We give several criteria for the quasi-compactness of these structure spaces. We study $T_0$ and $T_1$ separation…
We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…
We consider spatial discretizations by the finite section method of the restricted group algebra of a finitely generated discrete group, which is represented as a concrete operator algebra via its left-regular representation. Special…
This paper is the first paper of three papers in a series, which intend to provide a systematic treatment for the space-filling curves of self-similar sets. In the present paper, we introduce a notion of \emph{linear graph-directed IFS}…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
We consider a fixed basis of a finitely generated free chain complex as a finite topological space and we present a sufficient condition for the singular homology of this space to be isomorphic with the homology of the chain complex.
We find universal spaces for Alexandroff and finite spaces and explore some of its topological properties as well as their description as inverse limits of finite spaces and Alexandroff extensions. They can be used as a natural environment…
We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…
We present a generalisation of the theory of iterated function systems and associated fractals to the setting of noncommutative geometry. Along the way, we discuss some ideas surrounding locally compact noncommutative metric spaces.
In architecture, city planning, visual arts, and other design areas, shapes are often made with points, or with structural representations based on point-sets. Shapes made with points can be understood more generally as finite arrangements…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal.…