public_html: comparison bsc-projects-12.html

equal deleted inserted replaced

-:f8220e81d0f2
+:b7f55c8b5744
 larger number of states, completely contrary to the idea of minimising the
 number of states. The task of this project is to implement this method, check that
 it actually works with some examples and
 compare it with more traditional methods for automata minimisation
 (in terms of run-time, code complexity, etc). Examples can be
-obtained by translating regular expressions into automata.
+obtained by translating regular expressions into automata. A natural extension
+of the project is therefore to implement a recogniser for regular expressions
+following, for example, this <A HREF="http://www.cl.cam.ac.uk/~so294/documents/jfp09.pdf">paper</A>.
 </p>
 <p>
 <B>Literature:</B>
 A good place to start with this project are the wikipedia articles
 to decide a number of problems in automated reasoning. Recently,
 <A HREF="http://www.cs.unibo.it/~asperti/">Andreas Asperti</A>
 proposed a simple method for deciding regular expression equivalence described
 <A HREF="http://www.cs.unibo.it/~asperti/PAPERS/compact.pdf">here</A>.
 The task is to implement this method and test it on examples.
-It would be also interesting to see whether Asperti's method also applies to
+It would be also interesting to see whether Asperti's method applies to
 extended regular expressions, described
 <A HREF="http://ww2.cs.mu.oz.au/~sulzmann/manuscript/reg-exp-partial-derivatives.pdf">here</A>.
 </p>
 <p>
 <p>
 While the hard work has been done (understanding the two papers above),
 my compiler only produces some idealised machine code. For example I
 assume there are infinitely many registers. The goal of this
-project is to generate machine code which is more realistic and can
+project is to generate machine code that is more realistic and can
-run on a CPU, like x86, or run on a virtual machine, say JVM.
+run on a CPU, like x86, or run on a virtual machine, say the JVM.
 This gives probably a speedup of thousand times in comparison to
 my naive machine code and virtual machine. The project
 requires to dig into the literature about real CPUs and generating
 real machine code.
 </p>
 The problem of student polling is not as hard as
 <A HREF="http://en.wikipedia.org/wiki/Electronic_voting">electronic voting</A>,
 which essentially is still an unsolved problem in Computer Science. The
 students only need to be prevented from answering question more than once thus skewing
 any statistics. Unlike electronic voting, no audit trail needs to be kept
-for student polling. Restricting the number of questions can probably be solved
+for student polling. Restricting the number of answers can probably be solved
 by setting appropriate cookies on the students
 computers or smart phones.
 </p>
 <p>
 <A HREF="http://www.heroku.com">Heroku</A>).
 For web-programming the
 <A HREF="http://www.udacity.com/overview/Course/cs253/CourseRev/apr2012">Web Application Engineering</A>
 course at <A HREF="http://www.udacity.com">Udacity</A> is a good starting point
 to be aware of the issues involved. This course uses <A HREF="http://www.python.org">Python</A>.
+To evaluate the answers from the student, Google's
+<A HREF="https://developers.google.com/chart/image/docs/making_charts">Chart Tools</A>
+might be useful, which ar also described in this
+<A HREF="http://www.youtube.com/watch?v=NZtgT4jgnE8">youtube</A> video.
 </p>
 <p><B>Skills:</B>
 In order to provide convenience for the lecturer, this project needs very good web-programming skills. A
 <A HREF="http://en.wikipedia.org/wiki/Hacker_(programmer_subculture)">hacker mentality</A>

changeset 133	b7f55c8b5744
parent 132	f8220e81d0f2
child 134	6e9c0d53ea69