index
:
teach/inf105.git
master
INF105 (THL: théorie des langages)
git repository hosting
summary
refs
log
tree
commit
diff
stats
log msg
author
committer
range
path:
root
/
notes-inf105.tex
Commit message (
Collapse
)
Author
Age
Files
Lines
*
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 ↵
David A. Madore
2017-01-16
1
-0
/
+34
|
|
|
|
algebraic languages.
*
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
|
*
Standardize spelling of "hors contexte".
David A. Madore
2017-01-02
1
-6
/
+6
|
*
Rational languages are algebraic; regular grammars.
David A. Madore
2017-01-02
1
-6
/
+55
|
*
Context-free grammars and languages: definition and example.
David A. Madore
2017-01-02
1
-12
/
+165
|
*
Clarify decidability of equivalence of automata or regexps.
David A. Madore
2016-12-08
1
-8
/
+52
|
*
Mention the name "Kleene's algorithm".
David A. Madore
2016-12-08
1
-1
/
+3
|
*
A clarification on elimination of states.
David A. Madore
2016-12-08
1
-24
/
+33
|
*
Remark on elimination of spontaneous transitions and automaton transpose.
David A. Madore
2016-12-08
1
-33
/
+84
|
*
Slight changes to section titles.
David A. Madore
2016-12-08
1
-5
/
+5
|
*
Example(s) of minimization algorithm.
David A. Madore
2016-12-08
1
-0
/
+137
|
*
Moore's algorithm (further description).
David A. Madore
2016-12-01
1
-3
/
+33
|
*
Various clarifications. Try to explicitate when DFAs need to be complete.
David A. Madore
2016-12-01
1
-52
/
+72
|
*
Fix mistake in determinization of automaton.
David A. Madore
2016-12-01
1
-10
/
+11
|
*
Moore's algorithm.
David A. Madore
2016-11-30
1
-2
/
+89
|
*
The Myhill-Nerode theorem.
David A. Madore
2016-11-30
1
-0
/
+87
|
*
Using the pumping lemma.
David A. Madore
2016-11-30
1
-49
/
+128
|
*
The pumping lemma.
David A. Madore
2016-11-30
1
-1
/
+64
|
*
More remarks about regexp syntax in the computer world.
David A. Madore
2016-11-28
1
-1
/
+38
|
*
Remarks on regexp notations in the real computer world.
David A. Madore
2016-11-25
1
-10
/
+85
|
*
Example of state elimination.
David A. Madore
2016-11-25
1
-1
/
+80
|
*
Regexp-labeled automata, equivalence with NFAs and with regexps.
David A. Madore
2016-11-25
1
-0
/
+216
|
*
Various additional remarks on regular expressions.
David A. Madore
2016-11-25
1
-33
/
+52
|
*
Use "denote" for the relation between a regular expression and a language.
David A. Madore
2016-11-25
1
-28
/
+36
|
*
Rational languages are recognizable.
David A. Madore
2016-11-25
1
-29
/
+148
|
*
Stability of recognizable languages under boolean operations and mirror.
David A. Madore
2016-11-25
1
-10
/
+140
|
*
NFAs with spontaneous transitions: equivalence.
David A. Madore
2016-11-25
1
-9
/
+109
|
*
Define ε-closure.
David A. Madore
2016-11-23
1
-2
/
+12
|
*
NFAs with spontaneous transitions.
David A. Madore
2016-11-23
1
-12
/
+127
|
*
NFAs and determinization of them.
David A. Madore
2016-11-23
1
-15
/
+257
|
[next]