Login / Signup
Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata.
Nazir Ahmad Zafar
Ajmal Hussain
Amir Ali
Published in:
J. Softw. Eng. Appl. (2009)
Keyphrases
</>
formal proof
strongly connected
directed graph
optimum path forest
theorem prover
cellular automata
finite automata
lattice gas
probabilistic automata
random walk
finite state
refinement process
natural language
probabilistic model
undirected graph