Login / Signup

An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs.

Yves Métivier
Published in: ICALP (1987)
Keyphrases
  • np hard
  • detection algorithm
  • learning algorithm
  • significant improvement
  • worst case
  • optimization algorithm
  • np complete
  • graph structure
  • spanning tree
  • search space
  • clustering method
  • finite state automata