Soonjo Hong

  • Citations Per Year
Learn More
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.
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)
  • 1