Undecidable Properties of Self-affine Sets and Multi-tape Automata
نویسندگان
چکیده
We study the decidability of some properties of self-affine sets specified by a graph-directed iterated function system (GIFS) with rational coefficients. We focus on topological properties and we prove that having empty interior is undecidable in dimension two. These results are obtained by studying a particular class of self-affine sets associated with multitape automata. We first establish the undecidability of some language-theoretical properties of such automata, which then translate into undecidability results about their associated self-affine sets.
منابع مشابه
Asynchronous Multi-Tape Automata Intersection: Undecidability and Approximation
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. This paper investigates to what extent it is still feasible to use multi-tape automata as recognizers of polyadic predicates on words. On the negative side, det...
متن کاملInfinite Games Specified by 2-Tape Automata
We prove that the determinacy of Gale-Stewart games whose winning sets are infinitary rational relations accepted by 2-tape Büchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal assumption. Then we prove that winning strategies, when they exist, can be very complex, i.e. highly non-effective, in these games. We prove the...
متن کاملHighly Undecidable Problems For Infinite Computations
We show that many classical decision problems about 1counter ω-languages, context free ω-languages, or infinitary rational relations, are Π12-complete, hence located at the second level of the analytical hierarchy, and “highly undecidable”. In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and t...
متن کاملMulti-tape automata for automatic verification
This paper discusses how finite-state automata with multiple tapes can be used to construct decision procedures for fragments of first-order theories with interpreted functions and relations, useful in the verification of programs. There is a natural correspondence between automata accepting input on n > 1 tapes and predicates over n variables, but multi-tape automata that read input asynchrono...
متن کاملUndecidable Properties of Limit Set Dynamics of Cellular Automata
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial properties of limit sets are undecidable. In this paper we consider properties of limit set dynamics, i.e. properties of the dynamics of Cellular Automata restric...
متن کامل