首页> 外文会议>The Proceedings of 1989 International Conference on Circuits and Systems >Realization of LISP Language Program in a Method of Generating Several Minimizing Solutions for Incompletely Specified Sequential Machines
【24h】

Realization of LISP Language Program in a Method of Generating Several Minimizing Solutions for Incompletely Specified Sequential Machines

机译:LISP语言程序在生成不完整指定顺序机器的几个最小化解的方法中的实现

获取原文
获取原文并翻译 | 示例

摘要

The study presented in this paper includes a method of generating multiple solutions for minimizing internal states of incompletely specified sequential machine,characteristics of LISP language program for realizing the method and comparisons of CPU times between this program and the other one proposed until.now by author.As a result,it is indicated that the former is superior to the latter,in terms of the facts that the former gives us the almost complete and multiple solutions with comparatively fast speed.
机译:本文提出的研究包括生成多种解决方案以最小化不完全指定的顺序机器内部状态的方法,LISP语言程序的特性以实现该方法以及该程序与其他程序之间的CPU时间比较。结果表明,从前者以相对较快的速度为我们提供了几乎完整和多种解决方案这一事实来看,前者优于后者。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号