Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata.

Nazir Ahmad Zafar Ajmal Hussain Amir Ali

Published in: J. Softw. Eng. Appl. (2010)

Keyphrases

strongly connected
cellular automata
directed graph
optimum path forest
model checking
special case
regular expressions
probabilistic automata
objective function
computational complexity
graphical models
finite state