Login / Signup

Algorithms for finding directed graph isomorphisms by finite automata.

Chao-Chih YangCharmane P. May
Published in: Int. J. Parallel Program. (1980)
Keyphrases
  • directed graph
  • finite automata
  • strongly connected
  • maximum flow
  • random walk
  • learning algorithm
  • grammatical inference
  • computational model
  • regular expressions
  • probabilistic automata