Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (11): 68-70.

• 理论研究 • Previous Articles     Next Articles

Minimization of (rt) order memory quasi-linear finite automata

ZHONG Xiang-gui,YI Zhong,DENG Pei-min   

  1. School of Mathematical Sciences,Guangxi Normal University,Guilin,Guangxi 541004,China
  • Received:2007-10-17 Revised:2007-12-29 Online:2008-04-11 Published:2008-04-11
  • Contact: ZHONG Xiang-gui

rt)阶存贮拟线性有限自动机的极小化

钟祥贵,易 忠,邓培民   

  1. 广西师范大学 数学科学学院,广西 桂林 541004
  • 通讯作者: 钟祥贵

Abstract: It is still a difficult problem at present to minimize(rt) order memory quasi-linear finite automata.In this paper,authors consider how to recognize the minimization automata through zero state,and description of the minimal linear finite automata and some algorithms of the minimization of finite automata are given.

Key words: linear finite automata, minimization, equivalent

摘要: 实现将一个有限自动机极小化是一个困难的问题。通过零状态考虑了一类(rt)阶存贮拟线性有限自动机极小化的判断方法,给出了极小线性有限自动机的描述,最后给出了基于系数矩阵的极小化算法实现。

关键词: 线性有限自动机, 极小化, 等价