Login / Signup

An Efficient Algorithm for Local Testability Problem of Finite State Automata.

Sam M. KimRobert McNaughton
Published in: COCOON (1995)
Keyphrases
  • finite state automata
  • dynamic programming
  • computational complexity
  • optimal solution
  • worst case
  • learning algorithm
  • np hard
  • logic programs
  • theoretical analysis
  • data model
  • upper bound