summaryrefslogtreecommitdiffstats
path: root/notes-inf105.tex
Commit message (Collapse)AuthorAgeFilesLines
* Spell-check.David A. Madore2018-01-081-2/+2
|
* Take into account Antoine's remarks.David A. Madore2018-01-081-10/+13
|
* Fix proof of standardization of automata.David A. Madore2017-11-281-3/+6
| | | | | The case where the added state should have been final was missing. Thanks to Antoine for pointing this out.
* Fix typo pointed out by Mikaël.David A. Madore2017-11-271-1/+1
|
* Minor clarification.David A. Madore2017-11-201-1/+1
|
* Increase inner margin (at expense of outer margin, so as to keep line width).printed-2017David A. Madore2017-11-141-1/+1
|
* Plenty more typos (thanks, Hélène S.).David A. Madore2017-11-141-11/+11
|
* Imprimatur.David A. Madore2017-11-131-10/+7
|
* Corrections suggested by a3nm.David A. Madore2017-11-131-3/+3
|
* Typo.David A. Madore2017-11-111-1/+1
|
* Missing comma.David A. Madore2017-11-101-1/+1
|
* Corrections suggested by Mikaël.David A. Madore2017-11-101-79/+83
|
* Downgrade level of unfinishedness and associated warning.David A. Madore2017-11-081-9/+6
|
* Add remark about escaping regexps under Unix shell.David A. Madore2017-11-081-0/+8
|
* Add remark about Kleene's star as smallest solution to an equation.David A. Madore2017-11-081-0/+10
|
* Change notation A_r to A(r) for consistency's sake.David A. Madore2017-11-081-17/+20
|
* Add more white space to make text less dense.David A. Madore2017-11-081-34/+260
|
* Add footnote on grammar of regexps themselves.David A. Madore2017-11-081-2/+9
|
* Change notations L_r and L_A to L(r) and L(A).David A. Madore2017-11-081-52/+53
|
* Corrections suggested by Jacques.David A. Madore2017-11-071-8/+8
|
* Expand discussion about practical parsing of CFGs (LL and LR approaches).David A. Madore2017-11-071-45/+97
|
* Reread description of CYK algorithm.David A. Madore2017-11-061-14/+15
|
* A brief description of the CYK dynamic programming algorithm for CFGs.David A. Madore2017-11-061-8/+107
|
* Reread and rework introduction to computability.David A. Madore2017-11-031-125/+184
|
* Reread section on formal grammars. Rewrite proof that algebraic languages ↵David A. Madore2017-11-031-51/+131
| | | | are decidable.
* More clarifications.David A. Madore2017-11-021-13/+20
|
* Various clarifications on context-free grammars.David A. Madore2017-11-021-97/+146
|
* Typographic logic.David A. Madore2017-11-021-6/+6
|
* Clarify what \footnotesize means.David A. Madore2017-11-021-0/+5
|
* Minor clarifications on formal grammars.David A. Madore2017-11-011-3/+11
|
* Some remarks on degenerate cases.David A. Madore2017-11-011-2/+27
|
* Primary terminology is "minimal" automaton, not "canonical".David A. Madore2017-11-011-5/+5
|
* Change acronym for incomplete automata to "DFAi" with lowercase i.David A. Madore2017-11-011-36/+36
| | | | Is this really a good idea? Maybe not.
* Rework various comments (especially on regular expressions).David A. Madore2017-11-011-68/+107
|
* Add another example of state elimination (limited-depth balanced parentheses).David A. Madore2017-11-011-0/+63
|
* An intuitive explanation of the pumping lemma's uses.David A. Madore2017-11-011-0/+12
|
* Reread sections on recognizable languages: various updates, clarifications, ↵David A. Madore2017-10-311-49/+86
| | | | fixes.
* Add general intro blurb.David A. Madore2017-10-311-7/+64
|
* Reread sections on automata: various updates, clarifications, fixes.David A. Madore2017-10-301-118/+151
|
* Compatibility with older TeXlive.David A. Madore2017-10-301-0/+1
|
* Introduction and clarifications on context-free grammars.David A. Madore2017-10-301-17/+82
|
* Illustration for the pumping lemma.David A. Madore2017-10-301-0/+35
|
* Remark on various equivalences of rational expressions.David A. Madore2017-10-291-10/+55
|
* Clarifications on how to decide equivalence of automata.David A. Madore2017-10-291-1/+23
|
* Clarifications on the state elimination algorithm.David A. Madore2017-10-291-19/+52
|
* Avoid widowing section titles.David A. Madore2017-10-291-1/+1
|
* Clarifications on why various kinds of automata are introduced, and on ↵David A. Madore2017-10-291-35/+106
| | | | Glushkov's construction.
* Describe the Thompson automaton of a regular expression.David A. Madore2017-10-291-8/+247
|
* More additions to index.David A. Madore2017-10-291-3/+3
|
* More additions to index.David A. Madore2017-10-291-3/+3
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-11-16 21:26:11 +0000