最小有限分支自动机

The Minimum Finite Branching Automata

本文讨论了有限分支自动机的枧范型,给出了最小有限分支自动机的概念.指出了,识别同一可识语言族的最小有限分支自动机在同构意义下是唯一的.同时还证明了,识别Σ上可识语言族 X 的最小有限分支自动机的结构被Σ上等价关系~X 唯一确定.

In this paper,we discuss a normal form of finite branching automa-ta,give out the concept about minimum finite branching automata andpoint out that,up to isomorphism,the minimum finite branching automatarecognizing a recognizable languages family X over Σ is unique,andthe structure of which is completely detrmined by the equivalent relation