标题： 关于带有透明词的重复有限自动机 显示英文标题

标题： On Repetitive Finite Automata with Translucent Words

摘要： 我们引入并研究了确定性和非确定性有限自动机带透明词（DFAwtw 和 NFAwtw）的重复变体。 在看到右哨兵时，重复的 NFAwtw 不需要立即停止，接受或拒绝，而是可以转换到另一个状态并继续其计算。 我们证明了重复的 DFAwtw 已经接受了一个甚至不是半线性的语言，这表明重复的性质显著提高了 DFAwtw 和 NFAwtw 的表达能力。 显示英文摘要

摘要： We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting or rejecting, but it may change into another state and continue with its computation. We establish that a repetitive DFAwtw already accepts a language that is not even semi-linear, which shows that the property of being repetitive increases the expressive capacity of the DFAwtw and the NFAwtw considerably.