- Full text PDF available (2)
- This year (0)
- Last 5 years (1)
- Last 10 years (2)
Journals and Conferences
We present three equivalent conditions for a generating set W of a renewal system to generate a maximal monoid in the language of the system. We show that if a code W generates a shift of finite type and satisfies those conditions, then it is cyclic. Sufficient conditions are given when the converse holds. © 2009 Elsevier B.V. All rights reserved.
Given a factor code π from a shift of finite type X onto a sofic shift Y , the class degree of π is defined to be the minimal number of transition classes over the points of Y . In this paper, we investigate the structure of transition classes and present several dynamical properties analogous to the properties of fibers of finite-to-one factor codes. As a… (More)
Reem Yassawi: Bratteli diagrams where almost all orders are imperfect. Abstract: An unordered Bratteli diagram can be thought of as a set of partial instructions to build a dynamical system via cutting-and-stacking. The edges of the diagram describe how to " cut " , but we need an order to define how these levels should be " stacked. Any linear order will… (More)