Login / Signup

Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata.

Shuhua Zhang
Published in: Theor. Comput. Sci. (1992)
Keyphrases
  • strongly connected
  • worst case
  • graph theory
  • data structure
  • computational complexity
  • special case
  • computational cost
  • finite automata
  • learning algorithm
  • optimization problems