带半透明字母的重复有限自动机
Repetitive Finite Automata With Translucent Letters
AI总结：
提出带半透明字母的重复有限自动机 RDFAwtl/RNFAwtl，允许在带结束标记处改状态继续计算，并刻画其相对表达能力。
摘要：
本文提出了带半透明字母的（确定性与非确定性）有限自动机（DFAwtl 和 NFAwtl）的一种扩展，其表达能力介于这些自动机与其非返回变体（即 nr-DFAwtl 和 nr-NFAwtl）之间。这种新模型的工作方式与 DFAwtl 或 NFAwtl 类似，但在看到带结束标记时，它可以改变内部状态并继续计算，而不是仅仅结束计算、接受或拒绝。这种新型自动机被称为带半透明字母的重复确定性或非确定性有限自动机（RDFAwtl 或 RNFAwtl）。在确定性情形下，新模型的表达能力严格强于 DFAwtl，但弱于 nr-DFAwtl；而在非确定性情形下，新模型与 NFAwtl 等价。
英文摘要：
Here we propose an extension of the (deterministic and the nondeterministic) finite automaton with translucent letters (DFAwtl and NFAwtl), which lies between these automata and their non-returning variants (that is, the nr-DFAwtl and the nr-NFAwtl). This new model works like a DFAwtl or an NFAwtl, but on seeing the end-of-tape marker, it may change its internal state and continue with its computation instead of just ending it, accepting or rejecting. This new type of automaton is called a repetitive deterministic or nondeterministic finite automaton with translucent letters (RDFAwtl or RNFAwtl). In the deterministic case, the new model is strictly more expressive than the DFAwtl, but less expressive than the nr-DFAwtl, while in the nondeterministic case, the new model is equivalent to the NFAwtl.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
