From b1cde222bfb7a02aa72a3fa4ea7247cca4cef5bf Mon Sep 17 00:00:00 2001
From: bringert <bringert@cs.chalmers.se>
Date: Wed, 3 Jan 2007 18:17:32 +0000
Subject: [PATCH] Updated reference to regular -> FA conversion.

---
 src/GF/Speech/CFGToFiniteState.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/GF/Speech/CFGToFiniteState.hs b/src/GF/Speech/CFGToFiniteState.hs
index 47ad4b7fe..feb4db0ed 100644
--- a/src/GF/Speech/CFGToFiniteState.hs
+++ b/src/GF/Speech/CFGToFiniteState.hs
@@ -104,7 +104,7 @@ compileAutomaton start g = make_fa (g,ns) s [Cat start] f fa
   ns = mutRecSets g $ mutRecCats False g
 
 -- | The make_fa algorithm from \"Regular approximation of CFLs: a grammatical view\",
---   Mark-Jan Nederhof. International Workshop on Parsing Technologies, 1997.
+--   Mark-Jan Nederhof, Advances in Probabilistic and other Parsing Technologies, 2000.
 make_fa :: (CFRules,MutRecSets) -> State -> [Symbol Cat_ Token] -> State 
           -> NFA Token -> NFA Token
 make_fa c@(g,ns) q0 alpha q1 fa =