Filters
Subshift attractors in cellular automata
A subshift attractor is a two-sided subshift which is an attractor of a cellular automaton. We prove that each subshift attractor is chain-mixing, contains isrecursively enumerable. We prove that a subshift of fini...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The chain relation in sofic subshifts
The paper gives a characterisation of the chain relation of a sofic subshift S. Factorising the graph of the sofic subshift in a suitable way we obtain a graph that offers insight into some properties of the original subshift
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Cellular Automata with Infinite Number of Subshift Attractors
We argue that the complexity of a cellular automaton is reflected in the complexity of the lattice of its subshift attractors We construct cellular automata with infinite lattice of subshift attractors of arbitrarily high complexity...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Moebius number systems based on interval covers
We construct the expansion subshift of all expansions of real numbers with respect to a given interval cover.
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Search Algorithm for the Maximal Attractor of a Cellular Automaton
We present an algorithm which finds the maximal attractor of some cellular automata whose maximal attractor is a sofic subshift. The algorithm finds signal subshifts, constructs their join and forward images of the join. If this pro...
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
A search algorithm for subshift attractors of cellular automata
We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton...
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Moebius number systems with sofic subshifts
A Moebius number system consists of a Moebius iterative system and a subshift included in the convergence space, such that any point measure can be obtained as the limit of some word of the subshift. We give some sufficient conditio...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On the partitions with Sturmian-like refinements
in terms of Sturmian subshifts: we show that for every non-trivial factor mapping from aone-sided Sturmian subshift, satisfying a mild technical assumption, the sliding......
BA - Obecná matematika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Convergence in Möbius number systems
subshifts instead of the whole symbolic space, we can ask what is the language complexity of these subshifts. We offer (under some assumptions) a sufficient......
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The Stern-Brocot graph in Mobius number systems
We characterize interval Mobius number systems with sofic expansion subshifts and show that they can be obtained as factors of interval Mobius number systems with expansion subshifts of finite types. The endpoints of interval cylind...
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 18