In this paper, we first give a necessary and sufficient condition for a factor code with an unambiguous symbol to admit a subshift of finite type restricted to which it is one-to-one and onto. We then give a necessary and sufficient condition for the standard factor code on a spoke graph to admit a subshift of finite type restricted to which it is finite-to-one and onto. We also conjecture that for such a code, the finite-to-one and onto property is equivalent to the existence of a stationary Markov chain that achieves the capacity of the corresponding deterministic channel.

中文翻译：

---

具有明确符号的因子代码的马尔可夫容量

在本文中，我们首先给出了具有明确符号的因子码承认有限类型子移的充分必要条件，该子移仅限于一对一且有限类型的子移。然后，我们给出辐条图上的标准因子代码的充分必要条件，以允许有限类型的子移位，该子移位限制为有限对一且有限。我们还推测，对于这样的代码，有限对一和本体性质等价于存在实现相应确定性信道容量的平稳马尔可夫链。