29 citations · 62 across the 7 of their papers we have counts for
7 papers
Constructions of subshifts with positive topological entropy dimension
Uijin Jung, Jungseob Lee, Kyewon Koh Park
The notion of entropy dimension has been introduced to measure the subexponential complexity of zero entropy systems. In this work we present a general construction of a strictly e…
Class-closing factor codes and constant-class-to-one factor codes from shifts of finite type
Mahsa Allahbakhshi, Soonjo Hong, Uijin Jung
We define class-closing factor codes from shifts of finite type and show that they are continuing if their images are of finite type. We establish several relations between class-c…
Structure of transition classes for factor codes on shifts of finite type
Mahsa Allahbakhshi, Soonjo Hong, Uijin Jung
Given a factor code from a shift of finite type onto a sofic shift , the class degree of is defined to be the minimal number of transition classes over points of …
Decompositions of factor codes and embeddings between shift spaces with unequal entropies
Soonjo Hong, Uijin Jung, In-Je Lee
Given a factor code between sofic shifts X and Y, there is a family of decompositions of the original code into factor codes such that the entropies of the intermediate subshifts a…
Bi-resolving graph homomorphisms and extensions of bi-closing codes
Uijin Jung, In-Je Lee
Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We inves…
Open maps between shift spaces
Uijin Jung
Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If th…
On the existence of open and bi-continuing codes
Uijin Jung
Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If thes…