论文标题
部分可观测时空混沌系统的无模型预测
Markov Capacity for Factor Codes with an Unambiguous Symbol
论文作者
论文摘要
在本文中，我们首先给出了具有明确符号的因子代码的必要条件，以承认限制在一对一的限制的有限类型的子缩影。然后，我们为辐条图上的标准因子代码提供了必要和充分的条件，以接收有限类型的子缩影，该类型限制为有限的一步。我们还猜想，对于这样的代码，此有限属性属性等效于具有实现相应确定性通道能力的固定马尔可夫链的存在。
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, this finite-to-one property is equivalent to the existence of a stationary Markov chain that achieves the capacity of the corresponding deterministic channel.
