Clive N. Galley

Learn More
We present the following lower bounds on automata minimisation given an n state automaton, and a binary alphabet, on the CRCW PRAM. (i) If we are given n p n work, then any algorithm we denote A, requires (log O(1) n) time. (ii) If we are given (n log log n) p n log log n work, then A requires (log n) time, which matches to within a constant our algorithm.(More)
  • 1