Synchronisation déterministe des automates à délai borné

详细信息    查看全文

• 作者：Frougny ; Christiane ; Sakarovitch ; Jacques
• 刊名：Theoretical Computer Science
• 出版年：1998
• 出版时间：January 30, 1998
• 年：1998
• 卷：191
• 期：1-2
• 页码：61-77
• 全文大小：873 K

文摘

It is shown that a subsequential automaton (i.e. an automaton deterministic with respect to the input) with bounded delay is equivalent to an on-line automaton, that is an automaton which is letter-to-letter after an initial period where it reads the input and output nothing, and subsequential. The results on the synchronisation of automaton with bounded delay established so far did not keep the property of being subsequential.