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 外文参考文献
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
您可能关注的文档
- Recurrent Polynomial Neural Networks for Enhancing Performance of GPS in Electric Systems 外文参考文献.doc
- Recurrent Syncope in a Cancer Patient A Case Report and Review of the Literature 外文参考文献.doc
- Recurrent Urinary Bladder Paraganglioma 外文参考文献.doc
- Recurrent Neurotropic Chloroma Report of a Case and Review of the Literature 外文参考文献.doc
- Recurrent Prolapsed Giant Uterine Polyp Comprised of Adenomyotic Cysts 外文参考文献.doc
- Recurrent Episodic Foot-Drop Following Surgery to the Thigh 外文参考文献.doc
- Recursive Asymptotic Hybrid Matrix Method for Acoustic Waves in Multilayered Piezoelectric Media 外文参考文献.doc
- Recursive determination of the enumerator for sums of three squares 外文参考文献.doc
- Recurrence Quantification Analysis of Spontaneous Electrophysiological Activity during Development Characterization of In Vitro Neuronal Networks Cultured on Multi Electrode Array Chips 外文参考文献.doc
- Recursive estimation of the claim rates and sizes in an insurance model 外文参考文献.doc
原创力文档

文档评论(0)