From 9311008b5f828c82cb1dbe92f1b7d220fbd57c94 Mon Sep 17 00:00:00 2001 From: Jean-Philippe Barrette-LaPierre Date: Thu, 26 Feb 2015 17:26:48 +0800 Subject: [PATCH] Small change to README.md --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 6443490..b8b7bad 100644 --- a/README.md +++ b/README.md @@ -20,6 +20,7 @@ The *FineNight* library contains many algorithms for Finite State Automatons. Th * Construction of an IADFA from a sorted dictionary * Graphviz support * Error-Tolerant IADFA + Almost all algorithms were taken from the book *Introduction to Automata Theory, Languages, and Computation* [hopcroft01]. The minimization algorithm is an implementation of Brzozowski's method [2]. In this method, the (possibly non-deterministic) automaton is reversed, determinized, reversed and determinized. I'll eventually add the Hopcroft's nlog(n) minimization algorithm [3] [John E. Hopcroft](http://www.cs.cornell.edu/Info/Department/Annual95/Faculty/Hopcroft.html), Rajeev Motwani and