summaryrefslogtreecommitdiffstats
path: root/notes-inf105.tex
Commit message (Collapse)AuthorAgeFilesLines
* 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
|
* Minor additions to titles and index.David A. Madore2017-10-281-5/+6
|
* Use more space on page (reduce margins) by using geometry package.David A. Madore2017-10-281-0/+1
|
* Add example illustrating Glushkov's construction.David A. Madore2017-10-281-1/+105
|
* More remarks on Glushkov automata.David A. Madore2017-10-271-3/+20
|
* Glushkov automata: define properly.David A. Madore2017-10-271-11/+52
|
* Rewrite stability of recognizable languages using Glushkov's construction.David A. Madore2017-10-271-81/+322
|
* Clarification of how automata with spontaneous transitions work.David A. Madore2017-10-271-45/+22
|
* Clarifications/additions on incomplete and nondeterministic automata.David A. Madore2017-10-261-59/+124
|
* Informal discussion of automata.David A. Madore2017-10-261-39/+105
|
* Section on rational languages: add informal introduction, some clarifications.David A. Madore2017-10-261-69/+154
|
* Add an index.David A. Madore2017-10-261-310/+389
|
* Various clarifications and updates to the sections on words and languages.David A. Madore2017-10-261-33/+97
|
* Various clarifications, corrections, todos...David A. Madore2017-10-191-52/+83
|
* Try to explain a little more how LL and LR parsers work (vigorous handwaving).David A. Madore2017-01-311-6/+118
|
* Move remark around.David A. Madore2017-01-301-5/+4
|
* Move notes on computability to main text.David A. Madore2017-01-231-0/+573
|
* Provide a short (and very hastily written) summary of the LL/LR approach.David A. Madore2017-01-161-2/+20
|
* Provide a short (and very hastily written) argument for the decidability of ↵David A. Madore2017-01-161-0/+34
| | | | algebraic languages.
* Start writing some general stuff about analysis of CFLs.David A. Madore2017-01-151-0/+74
|
* Add warning about work in progress.David A. Madore2017-01-101-0/+12
|
* Intersection of algebraic and rational languages.David A. Madore2017-01-101-0/+38
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-11-13 16:56:02 +0000