| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Add a further question to an exercise. | David A. Madore | 2017-12-07 | 3 | -0/+35 |
| * | Corrections suggested by a3nm. | David A. Madore | 2017-11-13 | 1 | -2/+2 |
| * | Add another example of state elimination (limited-depth balanced parentheses). | David A. Madore | 2017-11-01 | 1 | -0/+18 |
| * | Describe the Thompson automaton of a regular expression. | David A. Madore | 2017-10-29 | 2 | -0/+46 |
| * | Add example illustrating Glushkov's construction. | David A. Madore | 2017-10-28 | 4 | -0/+54 |
| * | Add missing transition on Thompson automaton. | David A. Madore | 2017-03-22 | 1 | -0/+1 |
| * | Recovery exam: an exercise on finite automata. | David A. Madore | 2017-03-17 | 3 | -0/+57 |
| * | Another exercise on context-free grammars. | David A. Madore | 2017-01-30 | 1 | -0/+22 |
| * | An exercise on Kleene's algorithm. | David A. Madore | 2017-01-30 | 1 | -0/+14 |
| * | An exercise on finite automata. | David A. Madore | 2017-01-27 | 3 | -0/+70 |
| * | Continue writing about the dangling else ambiguity. | David A. Madore | 2017-01-12 | 2 | -0/+72 |
| * | Start writing a new exercise on the "dangling else" problem. | David A. Madore | 2017-01-12 | 1 | -0/+42 |
| * | Add two figures (parse tree) forgotten from commit 029a75c. | David A. Madore | 2017-01-10 | 2 | -0/+36 |
| * | Start discussing parse trees. | David A. Madore | 2017-01-02 | 1 | -0/+44 |
| * | Example(s) of minimization algorithm. | David A. Madore | 2016-12-08 | 4 | -0/+78 |
| * | Fix mistake in determinization of automaton. | David A. Madore | 2016-12-01 | 1 | -1/+2 |
| * | Fix mistake in minimization of automaton. | David A. Madore | 2016-11-30 | 1 | -3/+5 |
| * | Exercise on determinizing and minimizing an automaton. | David A. Madore | 2016-11-30 | 4 | -0/+95 |
| * | Write an exercise on rational languages. | David A. Madore | 2016-11-29 | 1 | -0/+11 |
| * | Example of state elimination. | David A. Madore | 2016-11-25 | 3 | -0/+36 |
| * | NFAs with spontaneous transitions: equivalence. | David A. Madore | 2016-11-25 | 1 | -0/+14 |
| * | NFAs with spontaneous transitions. | David A. Madore | 2016-11-23 | 2 | -4/+17 |
| * | NFAs and determinization of them. | David A. Madore | 2016-11-23 | 2 | -0/+27 |
| * | Incomplete DFAs. Change formating of self-loops in graphs. | David A. Madore | 2016-11-23 | 5 | -7/+38 |
| * | Accessible and inaccessible states. | David A. Madore | 2016-11-23 | 1 | -0/+13 |
| * | More on DFAs. | David A. Madore | 2016-11-23 | 1 | -0/+13 |
| * | Start defining DFAs, and give a first example (typeset with dot2tex + TikZ). | David A. Madore | 2016-11-14 | 1 | -0/+11 |
