--- a/src/HOL/Lex/README.html Sat Nov 18 14:55:44 1995 +0100
+++ b/src/HOL/Lex/README.html Sat Nov 18 15:35:24 1995 +0100
@@ -1,7 +1,7 @@
<HTML><HEAD><TITLE>HOL/Lex/ReadMe</TITLE></HEAD>
<BODY>
-<H2>A Simplified Scanner Generator</H2>
+<H1>A Simplified Scanner Generator</H1>
This is half of a simplified functional scanner generator. The overall design
is like this:
@@ -34,8 +34,15 @@
diagram, i.e. the translation of regular expressions into deterministic
finite automata is still missing. <P>
-<B>WANTED:</B> a theoretically inclined student to formalize a bit of
-undergraduate level automata theory. This could be worth a "Diplom" or an
-M.Sc. It could also be undertaken as a two-person "Fopra".
+<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>