summaryrefslogtreecommitdiffstats
path: root/notes-inf105.tex
Commit message (Collapse)AuthorAgeFilesLines
* 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
|
* Pumping lemma for algebraic languages.David A. Madore2017-01-101-1/+42
|
* More about ambiguity.David A. Madore2017-01-101-26/+191
|
* Briefly mention more general grammars. Start writing about ambiguity.David A. Madore2017-01-031-3/+28
|
* Parse trees versus derivations; left and right derivations.David A. Madore2017-01-031-16/+98
|
* Start discussing parse trees.David A. Madore2017-01-021-2/+103
|
* Various examples of CFGs (not necessarily interesting).David A. Madore2017-01-021-2/+136
|
* Another example of CFG (too complicated?).David A. Madore2017-01-021-0/+44
|
* Concatenation, union and star of CFLs.David A. Madore2017-01-021-20/+108
|
* Standardize spelling of "hors contexte".David A. Madore2017-01-021-6/+6
|
* Rational languages are algebraic; regular grammars.David A. Madore2017-01-021-6/+55
|
* Context-free grammars and languages: definition and example.David A. Madore2017-01-021-12/+165
|
* Clarify decidability of equivalence of automata or regexps.David A. Madore2016-12-081-8/+52
|
* Mention the name "Kleene's algorithm".David A. Madore2016-12-081-1/+3
|
* A clarification on elimination of states.David A. Madore2016-12-081-24/+33
|
* Remark on elimination of spontaneous transitions and automaton transpose.David A. Madore2016-12-081-33/+84
|
* Slight changes to section titles.David A. Madore2016-12-081-5/+5
|
* Example(s) of minimization algorithm.David A. Madore2016-12-081-0/+137
|
* Moore's algorithm (further description).David A. Madore2016-12-011-3/+33
|
* Various clarifications. Try to explicitate when DFAs need to be complete.David A. Madore2016-12-011-52/+72
|
* Fix mistake in determinization of automaton.David A. Madore2016-12-011-10/+11
|
* Moore's algorithm.David A. Madore2016-11-301-2/+89
|
* The Myhill-Nerode theorem.David A. Madore2016-11-301-0/+87
|
* Using the pumping lemma.David A. Madore2016-11-301-49/+128
|
* The pumping lemma.David A. Madore2016-11-301-1/+64
|
* More remarks about regexp syntax in the computer world.David A. Madore2016-11-281-1/+38
|
* Remarks on regexp notations in the real computer world.David A. Madore2016-11-251-10/+85
|
* Example of state elimination.David A. Madore2016-11-251-1/+80
|
* Regexp-labeled automata, equivalence with NFAs and with regexps.David A. Madore2016-11-251-0/+216
|
* Various additional remarks on regular expressions.David A. Madore2016-11-251-33/+52
|
* Use "denote" for the relation between a regular expression and a language.David A. Madore2016-11-251-28/+36
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-23 20:16:49 +0000