Login / Signup

An Upper Bound on the Order of Locally Testable Deterministic Finite Automata.

Sam M. KimRobert McNaughtonRobert McCloskey
Published in: Optimal Algorithms (1989)
Keyphrases
  • upper bound
  • lower bound
  • deterministic finite automata
  • worst case
  • regular expressions
  • e learning
  • decision trees
  • multi agent