Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata 外文参考文献.docVIP

  • 3
  • 0
  • 约3.93万字
  • 约 9页
  • 2017-05-10 发布于上海
  • 举报

Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata 外文参考文献.doc

Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata 外文参考文献

J. Software Engineering Applications, 2009, 2: 77-85 doi:10.4236/jsea.2009.22012 Published Online July 2009 (www.SciRP.org/journal/jsea) Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata Nazir Ahmad Zafar, Ajmal Hussain, Amir Ali Faculty of Information Technology, University of Central Punjab, 31-A, Main Gulberg, Lahore, Pakistan Email: {dr.zafar, ajmal, amiralishaihid}@.pk Received January 13 , 2009; revised February 27 , 2009; accepted March 24 , 2009. th th

文档评论(0)

1亿VIP精品文档

相关文档