| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Minor clarifications on formal grammars. | David A. Madore | 2017-11-01 | 1 | -3/+11 |
| * | Some remarks on degenerate cases. | David A. Madore | 2017-11-01 | 1 | -2/+27 |
| * | Primary terminology is "minimal" automaton, not "canonical". | David A. Madore | 2017-11-01 | 1 | -5/+5 |
| * | Change acronym for incomplete automata to "DFAi" with lowercase i. | David A. Madore | 2017-11-01 | 1 | -36/+36 |
| * | Rework various comments (especially on regular expressions). | David A. Madore | 2017-11-01 | 1 | -68/+107 |
| * | Add another example of state elimination (limited-depth balanced parentheses). | David A. Madore | 2017-11-01 | 1 | -0/+63 |
| * | An intuitive explanation of the pumping lemma's uses. | David A. Madore | 2017-11-01 | 1 | -0/+12 |
| * | Reread sections on recognizable languages: various updates, clarifications, f... | David A. Madore | 2017-10-31 | 1 | -49/+86 |
| * | Add general intro blurb. | David A. Madore | 2017-10-31 | 1 | -7/+64 |
| * | Reread sections on automata: various updates, clarifications, fixes. | David A. Madore | 2017-10-30 | 1 | -118/+151 |
| * | Compatibility with older TeXlive. | David A. Madore | 2017-10-30 | 1 | -0/+1 |
| * | Introduction and clarifications on context-free grammars. | David A. Madore | 2017-10-30 | 1 | -17/+82 |
| * | Illustration for the pumping lemma. | David A. Madore | 2017-10-30 | 1 | -0/+35 |
| * | Remark on various equivalences of rational expressions. | David A. Madore | 2017-10-29 | 1 | -10/+55 |
| * | Clarifications on how to decide equivalence of automata. | David A. Madore | 2017-10-29 | 1 | -1/+23 |
| * | Clarifications on the state elimination algorithm. | David A. Madore | 2017-10-29 | 1 | -19/+52 |
| * | Avoid widowing section titles. | David A. Madore | 2017-10-29 | 1 | -1/+1 |
| * | Clarifications on why various kinds of automata are introduced, and on Glushk... | David A. Madore | 2017-10-29 | 1 | -35/+106 |
| * | Describe the Thompson automaton of a regular expression. | David A. Madore | 2017-10-29 | 1 | -8/+247 |
| * | More additions to index. | David A. Madore | 2017-10-29 | 1 | -3/+3 |
| * | More additions to index. | David A. Madore | 2017-10-29 | 1 | -3/+3 |
| * | Minor additions to titles and index. | David A. Madore | 2017-10-28 | 1 | -5/+6 |
| * | Use more space on page (reduce margins) by using geometry package. | David A. Madore | 2017-10-28 | 1 | -0/+1 |
| * | Add example illustrating Glushkov's construction. | David A. Madore | 2017-10-28 | 1 | -1/+105 |
| * | More remarks on Glushkov automata. | David A. Madore | 2017-10-27 | 1 | -3/+20 |
| * | Glushkov automata: define properly. | David A. Madore | 2017-10-27 | 1 | -11/+52 |
| * | Rewrite stability of recognizable languages using Glushkov's construction. | David A. Madore | 2017-10-27 | 1 | -81/+322 |
| * | Clarification of how automata with spontaneous transitions work. | David A. Madore | 2017-10-27 | 1 | -45/+22 |
| * | Clarifications/additions on incomplete and nondeterministic automata. | David A. Madore | 2017-10-26 | 1 | -59/+124 |
| * | Informal discussion of automata. | David A. Madore | 2017-10-26 | 1 | -39/+105 |
| * | 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 |
| * | 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 |
| * | Move notes on computability to main text. | David A. Madore | 2017-01-23 | 1 | -0/+573 |
| * | Provide a short (and very hastily written) summary of the LL/LR approach. | David A. Madore | 2017-01-16 | 1 | -2/+20 |
| * | Provide a short (and very hastily written) argument for the decidability of a... | David A. Madore | 2017-01-16 | 1 | -0/+34 |
| * | Start writing some general stuff about analysis of CFLs. | David A. Madore | 2017-01-15 | 1 | -0/+74 |
| * | Add warning about work in progress. | David A. Madore | 2017-01-10 | 1 | -0/+12 |
| * | Intersection of algebraic and rational languages. | David A. Madore | 2017-01-10 | 1 | -0/+38 |
| * | Pumping lemma for algebraic languages. | David A. Madore | 2017-01-10 | 1 | -1/+42 |
| * | More about ambiguity. | David A. Madore | 2017-01-10 | 1 | -26/+191 |
| * | Briefly mention more general grammars. Start writing about ambiguity. | David A. Madore | 2017-01-03 | 1 | -3/+28 |
| * | Parse trees versus derivations; left and right derivations. | David A. Madore | 2017-01-03 | 1 | -16/+98 |
| * | Start discussing parse trees. | David A. Madore | 2017-01-02 | 1 | -2/+103 |
| * | Various examples of CFGs (not necessarily interesting). | David A. Madore | 2017-01-02 | 1 | -2/+136 |
| * | Another example of CFG (too complicated?). | David A. Madore | 2017-01-02 | 1 | -0/+44 |
| * | Concatenation, union and star of CFLs. | David A. Madore | 2017-01-02 | 1 | -20/+108 |
