| Commit message (Expand) | Author | Age | Files | Lines |
| ... | |
| * | Section on rational languages: add informal introduction, some clarifications. | David A. Madore | 2017-10-26 | 1 | -69/+154 |
| * | Add an index. | David A. Madore | 2017-10-26 | 1 | -310/+389 |
| * | Various clarifications and updates to the sections on words and languages. | David A. Madore | 2017-10-26 | 1 | -33/+97 |
| * | Various clarifications, corrections, todos... | David A. Madore | 2017-10-19 | 1 | -52/+83 |
| * | Comments on exam. [Forgotten commit, changes made on 2017-05-28.] | David A. Madore | 2017-10-19 | 1 | -3/+71 |
| * | Spello. | David A. Madore | 2017-05-28 | 1 | -1/+1 |
| * | Suggest two options on how to solve the last question.exam-20170330 | David A. Madore | 2017-03-25 | 1 | -3/+38 |
| * | Take into account Antoine's remarks. | David A. Madore | 2017-03-22 | 1 | -31/+35 |
| * | Add missing transition on Thompson automaton. | David A. Madore | 2017-03-22 | 2 | -27/+29 |
| * | Put Kleene's star in exponent. | David A. Madore | 2017-03-18 | 1 | -4/+4 |
| * | Take into account Akim's remarks. | David A. Madore | 2017-03-18 | 1 | -12/+6 |
| * | Final exercise (computability). | David A. Madore | 2017-03-17 | 1 | -3/+69 |
| * | Another exercise (on various kinds of languages). | David A. Madore | 2017-03-17 | 1 | -0/+174 |
| * | Recovery exam: an exercise on finite automata. | David A. Madore | 2017-03-17 | 4 | -0/+345 |
| * | Indicate final grading weights. | David A. Madore | 2017-03-10 | 1 | -4/+10 |
| * | Various additional comments. | David A. Madore | 2017-03-03 | 1 | -3/+19 |
| * | Add various comments on exam. | David A. Madore | 2017-03-03 | 1 | -3/+84 |
| * | Fix typo (thanks, Antoine). | David A. Madore | 2017-03-02 | 1 | -6/+7 |
| * | Indicative grading.exam-20170207 | David A. Madore | 2017-02-05 | 1 | -0/+2 |
| * | Microscopic reformulation. | David A. Madore | 2017-02-05 | 1 | -2/+2 |
| * | Trivial change on page number indication. | David A. Madore | 2017-02-05 | 1 | -1/+5 |
| * | Take into account Akim's remarks. | David A. Madore | 2017-02-05 | 1 | -80/+86 |
| * | Take into account Antoine's remarks, rework the end of the third exercise. | David A. Madore | 2017-02-05 | 1 | -58/+79 |
| * | More re-reading and discussion with Bertrand. | David A. Madore | 2017-02-05 | 1 | -12/+16 |
| * | Re-read exam. | David A. Madore | 2017-02-05 | 1 | -53/+75 |
| * | Rework and write solution to third exercise. | David A. Madore | 2017-02-05 | 1 | -8/+109 |
| * | Write another exercise (without answers). | David A. Madore | 2017-02-05 | 1 | -0/+38 |
| * | Add an exercise on computability. | David A. Madore | 2017-02-05 | 1 | -0/+131 |
| * | Offer additional question to allow checking for mistakes. | David A. Madore | 2017-02-05 | 1 | -4/+15 |
| * | Typographic frill. | David A. Madore | 2017-02-05 | 1 | -4/+4 |
| * | More working with automaton. | David A. Madore | 2017-02-05 | 1 | -13/+170 |
| * | Start writing an exercise on finite automata. | David A. Madore | 2017-02-05 | 1 | -0/+126 |
| * | Exam template. | David A. Madore | 2017-02-05 | 1 | -0/+113 |
| * | Fix mistake in elimination of states (thanks, Mathis Chagneux). | David A. Madore | 2017-02-05 | 1 | -5/+7 |
| * | Try to explain a little more how LL and LR parsers work (vigorous handwaving). | David A. Madore | 2017-01-31 | 1 | -6/+118 |
| * | Move remark around. | David A. Madore | 2017-01-30 | 1 | -5/+4 |
| * | Clarifications on curriculum. | David A. Madore | 2017-01-30 | 1 | -9/+12 |
| * | Re-read exercises. | David A. Madore | 2017-01-30 | 1 | -37/+48 |
| * | Fiddle with vertical spacing (i.e., struggle against TeX's page breaking algo... | David A. Madore | 2017-01-30 | 1 | -7/+39 |
| * | Another exercise on context-free grammars. | David A. Madore | 2017-01-30 | 2 | -0/+108 |
| * | Exercise on non-ambiguity and analysis of a simple context-free grammar. | David A. Madore | 2017-01-30 | 1 | -0/+161 |
| * | Remove syntactic ambiguity. | David A. Madore | 2017-01-30 | 1 | -1/+1 |
| * | Clarify statement on busy-beaver function. | David A. Madore | 2017-01-30 | 1 | -5/+6 |
| * | An exercise on Kleene's algorithm. | David A. Madore | 2017-01-30 | 2 | -0/+102 |
| * | Fix/clarification in answer to an exercise. | David A. Madore | 2017-01-30 | 1 | -1/+2 |
| * | An exercise on finite automata. | David A. Madore | 2017-01-27 | 4 | -0/+251 |
| * | Another exercise on computability (decidable iff range of an increasing compu... | David A. Madore | 2017-01-27 | 1 | -0/+60 |
| * | Another exercice on decidability. | David A. Madore | 2017-01-27 | 1 | -2/+69 |
| * | Busy beaver function. | David A. Madore | 2017-01-27 | 1 | -0/+65 |
| * | Union, intersection, concatenation and star of decidable vs. semi-decidable l... | David A. Madore | 2017-01-27 | 1 | -0/+97 |