1 - 10 of 20 articles
This article describes the work of Ki Hang Kim and Fred Roush on questions of decidability in algebra and number theory.
A Borel system consists of a measurable automorphism of a standard Borel space. We consider Borel embeddings and isomorphisms between such systems modulo null sets, i.e. sets which have measure zero for every invariant probability measure. For every t>0 we show that in this category, up to...
In this article we study how a subshift can simulate another one, where the notion of simulation is given by operations on subshifts inspired by the dynamical systems theory (factor, projective subaction …). There exists a correspondence between the notion of simulation and the set of forbidden...
In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y,f) is a finitely presented system, then there exists a Smale space (X,F) and a u-resolving factor map π
+:X→Y. If the finitely presented system is transitive,...
We introduce a concept of independence entropy for symbolic dynamical systems. This notion of entropy measures the extent to which one can freely insert symbols in positions without violating the constraint defined by the shift space. We show that for a certain class of one-dimensional shift...
Here we study a class of dynamical systems we call polynomial odometers. These are adic maps on regularly structured Bratteli diagrams and include the Pascal and Stirling adic maps as examples. We describe the dimension groups associated with these systems and use this to study spaces of...
We discuss a synchronization property for subshifts, that we call λ-synchronization. Under an irreducibility assumption we associate to a λ-synchronizing subshift a simple C
Permutation cellular automata are cellular automata defined by using finite maximal prefix codes. The overall dynamics of onesided and twosided permutation cellular automata is studied. For some classes of permutation cellular automata including the class of those defined by using finite maximal...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.