Login / Signup
Formal Proof of Equivalence in Endomorphisms and Automorphisms over Strongly Connected Automata.
Nazir Ahmad Zafar
Ajmal Hussain
Amir Ali
Published in:
CSSE (2) (2008)
Keyphrases
</>
formal proof
strongly connected
directed graph
theorem prover
optimum path forest
finite automata
cellular automata
regular expressions
turing machine
lattice gas
finite state machines
finite state
probabilistic automata
nearest neighbor
equivalence relation