--- a/src/HOL/Lex/README.html Wed May 21 17:11:46 1997 +0200
+++ b/src/HOL/Lex/README.html Wed May 21 17:13:00 1997 +0200
@@ -1,4 +1,4 @@
-<HTML><HEAD><TITLE>HOL/Lex/ReadMe</TITLE></HEAD>
+<HTML><HEAD><TITLE>HOL/Lex/README</TITLE></HEAD>
<BODY>
<H1>A Simplified Scanner Generator</H1>
@@ -34,15 +34,5 @@
diagram, i.e. the translation of regular expressions into deterministic
finite automata is still missing. <P>
-<H2>M.Sc./Diplom/Fopra Project</H2>
-
-Task: formalize the translation of regular expressions into deterministic
-finite automata. We are looking for a theoretically inclined student who
-likes automata theory and is not afraid of logic and proofs. Sounds
-interesting? Then contact <A
-HREF="http://www4.informatik.tu-muenchen.de/~nipkow/">Tobias Nipkow</A> or <A
-HREF="http://www4.informatik.tu-muenchen.de/~pusch/">Cornelia Pusch</A>.
-This project is also suitable as a joint "Fopra" for two students.
-
</BODY>
</HTML>