期刊文献+

有限自动机存储器实现方法 被引量:3

A FEASIBLE METHOD FOR ACHIEVING FINITE AUTOMATION
在线阅读 下载PDF
导出
摘要 叙述了自动机可用EPROM存储器来实现的新方法。把有限自动机每一状态及在此状态下的输入信息作为地址,对应这个地址的存储单元存放下一个状态及输出信息,通过对EPROM的读操作,使数据线上产生相应的输出,实现自动机的动作。这样可使逻辑线路大为简化,因而大大提高了可靠性。 A new method was proposed for realizing the finite automaton with EPROM. the input signals of the finite automation were regarded as the addresses of the EPROM memory, and the appropriate state messages were stored in the corresponding locations. Then, the state messages read out by the EPROM and the actions of the finite automaton were realized, thus greatly simplifying the logic circuits and enhancing the reliability.
作者 刘大本
出处 《青岛大学学报(工程技术版)》 CAS 2000年第4期66-68,共3页 Journal of Qingdao University(Engineering & Technology Edition)
关键词 有限自动机 EPROM存储器 数学模型 逻辑网络 finite automation EPROM memory mathematical model logic network
  • 相关文献

参考文献2

  • 1左考凌,李为鑒,刘永才.离散数学[M].上海:上海科学技术文献出版社,1999.
  • 2周明德.微型计算机硬件、软件及其应用[M].北京:清华大学出版社,1990.

同被引文献17

  • 1韩光辉.有限自动机的最小化理论[J].江汉大学学报(自然科学版),2005,33(4):14-16. 被引量:6
  • 2[1]BergadanoF,VarricchioS.Learning Behaviors of Automata Multiplicity and Equivalence Queries[J].SLAMJ Comput,1999,25:6-12.
  • 3[2]Amos Beimel,Francesco Bergadano,Nader H Bshouty,et al.Learning Functions Represented as Multiplicity Automata[J].J ACM.2002,47(5):506-512.
  • 4[5]Einspahr K L,Mehta S K,Seth S C.A synthesis for Testability Scheme for Finite State Machines Using Clock Control[J].IEEE Transactions on Computer-Aided Design,1999,18(12):1 780-1 792.
  • 5[9]Ginsburg S.An Introduction to Mathematical Machine Theory[M].Reading:Addison-Wesley Publishing Company,Inc,1962.
  • 6Shannon C E,McCarthy J.Automata studies[M].Princeton:Princeton University Press,1956.
  • 7Rabin M O,Scott D.Finite automata and their decision problems[J].IBM J Res Develop,1959,3:114-125.
  • 8Chomsky N.On certain formal properties of grammars[J].Information and Control,1959,2:137-167.
  • 9Hopcroft J E,Ullman J D.Introduction to automata theory[M].Reading:Languages and Computation,Addison-Wesley,1979.
  • 10Bergadano F,Varricchio S.Learning behaviors of automata multiplicity and equivalence queries [J].SLAMJ Comput,1999,25:6-12.

引证文献3

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部