首页> 外文会议>International Conference on Theoretical and Mathematical Foundations of Computer Science >A New Representation of Weighted Finite Automata via Recurrence and Group Rings
【24h】

A New Representation of Weighted Finite Automata via Recurrence and Group Rings

机译:通过复发和组戒指的加权有限自动机的新代表

获取原文

摘要

The current paper contains a new method of the implementation and application of weighted finite automata (WFA) and rational formal power series (FPS). The results presented in this paper can seem highly surprising since they are not comparable to the any previous results on the subject matter. It elaborates the author's ideas presented at FPSAC 04 [1].
机译:目前纸张包含了一种新的加权有限自动机(WFA)和合理正式电源系列(FPS)的新方法。本文提出的结果似乎非常令人惊讶,因为它们与主题的任何先前结果都没有相当。它详细阐述了作者在FPSAC 04 [1]上提出的想法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号