arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.5318cs.FL
收藏

自动机的最小化

Minimization of Automata

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot

摘要:

这一章关注的是最小化有限自动机的算法的设计和分析。在文本处理、图像分析、语言学计算机科学和许多其他应用的框架中,获得最小自动机是有限自动机工具的使用和实现中的一个基本问题。最小化算法主要有两类。第一种是对状态集的划分进行一系列细化,第二种是对状态进行一系列融合或合并。Hopcroft和Moore算法属于第一类,Revuz的无环自动机的线性时间最小化算法属于第二类。我们的研究之一是比较的性质摩尔和Hopcroft的算法。这在两种算法中提供了一些新的见解。正如我们将看到的,这些算法在行为和复杂性上都有很大的不同。特别是,我们表明,它是不可能的模拟计算的算法之一,由其他。我们描述了所谓的局部自动机融合的最小化算法。最小化的一个特殊情况是构造有限集合的最小自动机。我们简要考虑这种情况,并特别描述增量算法。最后,我们考虑的情况下,更新一个最小的自动机时,一个字被添加或删除的集合,它承认。

英文摘要:

This chapter is concerned with the design and analysis of algorithms for minimizing finite automata. Getting a minimal automaton is a fundamental issue in the use and implementation of finite automata tools in frameworks like text processing, image analysis, linguistic computer science, and many other applications. There are two main families of minimization algorithms. The first by a sequence of refinements of a partition of the set of states, the second by a sequence of fusions or merges of states. Hopcroft's and Moore's algorithms belong to the first family, the linear-time minimization of acyclic automata of Revuz belongs to the second family. One of our studies is upon the comparison of the nature of Moore's and Hopcroft's algorithms. This gives some new insight in both algorithms. As we shall see, these algorithms are quite different both in behavior and in complexity. In particular, we show that it is not possible to simulate the computations of one of the algorithm by the other. We describe the minimization algorithm by fusion for so-called local automata. A special case of minimization is the construction o minimal automata for finite sets. We consider briefly this case, and in particular describe incremental algorithms. Finally, we consider the case of updating a minimal automaton when a word is added or removed from the set it recognizes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑