Recent Results on Automata and Infinite Words
Recent Results on Automata and Infinite Words
复制标题
自动机和无限词的最新结果
DOI：
--
复制
发表时间：
1984
期刊：
影响因子：
--
通讯作者：
D. Perrin
中科院分区：
文献类型：
--
作者：
D. Perrin
无限词上的自动机理论是由Buchi和McNaughton在60年代初提出的，带有数理逻辑的味道。至于自动机理论的其余部分，它使用计算机科学家熟悉的概念和方法。对无限词的考虑，乍一看似乎是高度哲学化的，当人们想要研究系统的属性时，确实有一种自然的解释，这些系统不应该最终停止，例如操作系统。在普通单词上使用自动机现在已经成为算法设计的几个领域的标准，我认为在未来的无限单词上使用自动机也会发生同样的事情。
The theory of automata on infinite words was initiated by Buchi and McNaughton at the beginning of the sixties, with a flavour of mathematical logic. As for the rest of automata theory, it uses concepts and methods which are familiar to computer scientists. The consideration of infinite words, which could in fact seem at first glance to be highly philosophical, has indeed a natural interpretation when one is wanting to study properties of systems that are not supposed to eventually stop, such as operating systems for instance. The use of automata on ordinary words has now become standard in several areas of algorithm design and I think that the same will happen in the next future with automata on infinite words.