Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
On the performance of automata minimization algorithms

Edit abstract data

Author(s): Marco Almeida, Nelma Moreira and Rogério Reis
Slot: Wed, 11:50-12:10, Room 22 (col. 4)


Apart from the theoretical worst-case running time analysis not much
  is known about the average-case analysis or practical performance of
  finite automata minimization algorithms. On this paper we compare
  the running time of four minimization algorithms based on
  experimental results.
  We applied these algorithms to both deterministic and
  non-deterministic random automata.

websites: Arnold Beckmann 2008-05-19 Valid HTML 4.01! Valid CSS!