| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Using the pumping lemma. | David A. Madore | 2016-11-30 | 1 | -49/+128 |
| * | Typo (thanks, Olivier). | David A. Madore | 2016-11-30 | 1 | -1/+1 |
| * | The pumping lemma. | David A. Madore | 2016-11-30 | 1 | -1/+64 |
| * | Clarifications. | David A. Madore | 2016-11-30 | 1 | -9/+11 |
| * | Fix mistake in minimization of automaton. | David A. Madore | 2016-11-30 | 2 | -28/+30 |
| * | Re-read exercise sheet. | David A. Madore | 2016-11-30 | 1 | -23/+25 |
| * | Exercise on determinizing and minimizing an automaton. | David A. Madore | 2016-11-30 | 5 | -0/+303 |
| * | Another exercise on rational languages. | David A. Madore | 2016-11-29 | 1 | -0/+25 |
| * | Write an exercise on rational languages. | David A. Madore | 2016-11-29 | 2 | -0/+228 |
| * | More remarks about regexp syntax in the computer world. | David A. Madore | 2016-11-28 | 1 | -1/+38 |
| * | Remarks on regexp notations in the real computer world. | David A. Madore | 2016-11-25 | 1 | -10/+85 |
| * | Example of state elimination. | David A. Madore | 2016-11-25 | 4 | -1/+116 |
| * | Regexp-labeled automata, equivalence with NFAs and with regexps. | David A. Madore | 2016-11-25 | 1 | -0/+216 |
| * | Various additional remarks on regular expressions. | David A. Madore | 2016-11-25 | 1 | -33/+52 |
| * | Use "denote" for the relation between a regular expression and a language. | David A. Madore | 2016-11-25 | 1 | -28/+36 |
| * | Rational languages are recognizable. | David A. Madore | 2016-11-25 | 1 | -29/+148 |
| * | Stability of recognizable languages under boolean operations and mirror. | David A. Madore | 2016-11-25 | 1 | -10/+140 |
| * | NFAs with spontaneous transitions: equivalence. | David A. Madore | 2016-11-25 | 2 | -9/+123 |
| * | Define ε-closure. | David A. Madore | 2016-11-23 | 1 | -2/+12 |
| * | NFAs with spontaneous transitions. | David A. Madore | 2016-11-23 | 3 | -16/+144 |
| * | NFAs and determinization of them. | David A. Madore | 2016-11-23 | 3 | -15/+284 |
| * | Trimming of incomplete DFAs. | David A. Madore | 2016-11-23 | 1 | -8/+31 |
| * | Incomplete DFAs. Change formating of self-loops in graphs. | David A. Madore | 2016-11-23 | 6 | -42/+236 |
| * | Accessible and inaccessible states. | David A. Madore | 2016-11-23 | 2 | -11/+73 |
| * | More on DFAs. | David A. Madore | 2016-11-23 | 2 | -28/+131 |
| * | Start defining DFAs, and give a first example (typeset with dot2tex + TikZ). | David A. Madore | 2016-11-14 | 2 | -9/+101 |
| * | More clarifications on rational languages and expressions. | David A. Madore | 2016-11-14 | 1 | -8/+28 |
| * | Mirror (=transpose) word, palindromes. | David A. Madore | 2016-11-09 | 1 | -0/+12 |
| * | Rational languages and rational expressions. | David A. Madore | 2016-11-09 | 1 | -0/+127 |
| * | Clarifications on Kleene's star, and the empty word. | David A. Madore | 2016-11-08 | 1 | -8/+37 |
| * | More about languages. | David A. Madore | 2016-11-07 | 1 | -4/+106 |
| * | Languages (start). | David A. Madore | 2016-11-07 | 1 | -5/+66 |
| * | Concatenation, prefixes, suffixes, factors and subwords. | David A. Madore | 2016-11-07 | 1 | -0/+126 |
| * | Start writing course notes. | David A. Madore | 2016-11-07 | 1 | -0/+198 |
| * | Be slightly more precise on what is expected about computability. | David A. Madore | 2016-11-04 | 1 | -1/+5 |
| * | Slight clarifications on proposed curriculum. | David A. Madore | 2016-11-04 | 1 | -6/+9 |
| * | Fix course number. | David A. Madore | 2016-11-04 | 1 | -1/+1 |
| * | Notes on computability. | David A. Madore | 2016-11-04 | 1 | -0/+605 |
| * | Planned curriculum for INF105. | David A. Madore | 2016-11-04 | 2 | -0/+147 |
