RYReem Yassawi

Reem Yassawi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Reem Yassawi has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Recognizability for sequences of morphisms

    by Valérie Berthé, Wolfgang Steiner, Jörg Thuswaldner, Reem Yassawi

    We investigate different notions of recognizability for a free monoid morphism $\sigma: \mathcal{A}^* \to \mathcal{B}^*$. Full recognizability occurs when each (aperiodic) point in $\mathcal{B}^\mathbb{Z}$ admits at most one tiling with words $\sigma(a)$, $a \in \mathcal{A}$. This is stronger than the classical notion of recognizability of a substitution $\sigma: \mathcal{A}^*\to\mathcal{A}^*$, where the tiling must be compatible with the language of the substitution. We show that if $|\mathcal A|=2$, or if $\sigma$'s incidence matrix has rank $|\mathcal A|$, or if $\sigma$ is permutative, then $\sigma$ is fully recognizable. Next we investigate the classical notion of recognizability and improve earlier results of Moss\'{e} (1992) and Bezuglyi, Kwiatkowski and Medynets (2009), by showing that any substitution is recognizable for aperiodic points in its substitutive shift. Finally we define recognizability and also eventual recognizability for sequences of morphisms which define an $S$-adic shift. We prove that a sequence of morphisms on alphabets of bounded size, such that compositions of consecutive morphisms are growing on all letters, is eventually recognizable for aperiodic points. We provide examples of eventually recognizable, but not recognizable, sequences of morphisms, and sequences of morphisms which are not eventually recognizable. As an application, for a recognizable sequence of morphisms, we obtain an almost everywhere bijective correspondence between the $S$-adic shift it generates, and the measurable Bratteli-Vershik dynamical system that it defines.

  • Open Access

    Automaticity and Invariant Measures of Linear Cellular Automata

    by Eric Rowland, Reem Yassawi

    We show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$ -automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$ , where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For the Ledrappier cellular automaton we construct a family of nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant measures on $\mathbb{F}_{3}^{\mathbb{Z}}$ . Finally, given a linear cellular automaton $\unicode[STIX]{x1D6F7}$ , we construct a nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant measure on $\mathbb{F}_{p}^{\mathbb{Z}}$ for all but finitely many $p$ .

  • Open Access

    Automorphisms of automatic shifts

    by Clemens Müllner, Reem Yassawi

    In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other nontrivial automorphisms arise from {\em twisted} compressions of another constant length substitution. We characterise the group of roots of the identity in both the measurable and topological setting. Finally, we show that any topological factor of a constant length substitution shift is topologically conjugate to a constant length substitution shift via a letter-to-letter code.

  • Top Cited Papers

    Recognizability for sequences of morphisms

    by Valérie Berthé, Wolfgang Steiner, Jörg M. Thuswaldner, Reem Yassawi

    We investigate different notions of recognizability for a free monoid morphism $\unicode[STIX]{x1D70E}:{\mathcal{A}}^{\ast }\rightarrow {\mathcal{B}}^{\ast }$ . Full recognizability occurs when each (aperiodic) point in ${\mathcal{B}}^{\mathbb{Z}}$ admits at most one tiling with words $\unicode[STIX]{x1D70E}(a)$ , $a\in {\mathcal{A}}$ . This is stronger than the classical notion of recognizability of a substitution $\unicode[STIX]{x1D70E}:{\mathcal{A}}^{\ast }\rightarrow {\mathcal{A}}^{\ast }$ , where the tiling must be compatible with the language of the substitution. We show that if $|{\mathcal{A}}|=2$ , or if $\unicode[STIX]{x1D70E}$ ’s incidence matrix has rank $|{\mathcal{A}}|$ , or if $\unicode[STIX]{x1D70E}$ is permutative, then $\unicode[STIX]{x1D70E}$ is fully recognizable. Next we investigate the classical notion of recognizability and improve earlier results of Mossé [Puissances de mots et reconnaissabilité des points fixes d’une substitution.Theoret. Comput. Sci.99(2) (1992), 327–334] and Bezuglyiet al[Aperiodic substitution systems and their Bratteli diagrams.Ergod. Th. & Dynam. Sys.29(1) (2009), 37–72], by showing that any substitution is recognizable for aperiodic points in its substitutive shift. Finally we define recognizability and also eventual recognizability for sequences of morphisms which define an $S$ -adic shift. We prove that a sequence of morphisms on alphabets of bounded size, such that compositions of consecutive morphisms are growing on all letters, is eventually recognizable for aperiodic points. We provide examples of eventually recognizable, but not recognizable, sequences of morphisms, and sequences of morphisms which are not eventually recognizable. As an application, for a recognizable sequence of morphisms, we obtain an almost everywhere bijective correspondence between the $S$ -adic shift it generates, and the measurable Bratteli–Vershik dynamical system that it defines.


  • Open Access

    Reversing and extended symmetries of shift spaces

    by Michael Baake, John A. G. Roberts, Reem Yassawi

    The reversing symmetry group is considered in the setting of symbolic dynamics. While this group is generally too big to be analysed in detail, there are interesting cases with some form of rigidity where one can determine all symmetries and reversing symmetries explicitly. They include Sturmian shifts as well as classic examples such as the Thue–Morse system with various generalisations or the Rudin–Shapiro system. We also look at generalisations of the reversing symmetry group to higher-dimensional shift spaces, then called the group of extended symmetries. We develop their basic theory for faithful $\mathbb{Z}^{d}$-actions, and determine the extended symmetry group of the chair tiling shift, which can be described as a model set, and of Ledrappier's shift, which is an example of algebraic origin.


  • Open Access

    Reversing and extended symmetries of shift spaces

    by Michael Baake, John Roberts, Reem Yassawi

    The reversing symmetry group is considered in the setting of symbolic dynamics. While this group is generally too big to be analysed in detail, there are interesting cases with some form of rigidity where one can determine all symmetries and reversing symmetries explicitly. They include Sturmian shifts as well as classic examples such as the Thue--Morse system with various generalisations or the Rudin--Shapiro system. We also look at generalisations of the reversing symmetry group to higher-dimensional shift spaces, then called the group of \emph{extended symmetries}. We develop their basic theory for faithful $\mathbb{Z}^{d}$-actions, and determine the extended symmetry group of the chair tiling shift, which can be described as a model set, and of Ledrappier's shift, which is an example of algebraic origin.