teach/inf105.git - INF105 (THL: théorie des langages)

	Commit message (Collapse)	Author	Age	Files	Lines
*	More about ambiguity.	David A. Madore	2017-01-10	1	-26/+191
\|
*	Fix thinko (thanks, Antoine!).	David A. Madore	2017-01-06	1	-1/+1
\|
*	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	2	-2/+147
\|
*	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
\|
*	Typo (thanks, Antoine).	David A. Madore	2016-12-28	1	-1/+1
\|
*	More minor clarifications / corrections.	David A. Madore	2016-12-13	2	-4/+4
\|
*	Clarifications following students' remarks/questions.	David A. Madore	2016-12-13	1	-3/+5
\|
*	Add a simple exercise.	David A. Madore	2016-12-12	1	-0/+21
\|
*	Typo.	David A. Madore	2016-12-12	1	-1/+1
\|
*	Explain how to produce a regexp that matches the multiples of 7 in base 10.	David A. Madore	2016-12-09	2	-1/+78
\|
*	Exercise on multiples of 7 in base 10.	David A. Madore	2016-12-09	1	-0/+26
\|
*	Exercise on backreferences.	David A. Madore	2016-12-09	2	-11/+82
\|
*	Test various egrep features.	David A. Madore	2016-12-09	2	-0/+69
\|
*	A simple exercise on using egrep.	David A. Madore	2016-12-09	2	-0/+212
\|
*	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	5	-0/+215
\|
*	Leading zeros in powers of two.	David A. Madore	2016-12-02	1	-1/+1
\|
*	Remove any ambiguity about whether 0 is a power of two (it is not).	David A. Madore	2016-12-01	1	-1/+1
\|
*	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	2	-11/+13
\|
*	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
\|
*	Typo (thanks, Olivier).	David A. Madore	2016-11-30	1	-1/+1
\|
*	The pumping lemma.	David A. Madore	2016-11-30	1	-1/+64
\|
*	Clarifications.	David A. Madore	2016-11-30	1	-9/+11
\|
*	Fix mistake in minimization of automaton.	David A. Madore	2016-11-30	2	-28/+30
\|
*	Re-read exercise sheet.	David A. Madore	2016-11-30	1	-23/+25
\|
*	Exercise on determinizing and minimizing an automaton.	David A. Madore	2016-11-30	5	-0/+303
\|
*	Another exercise on rational languages.	David A. Madore	2016-11-29	1	-0/+25
\|
*	Write an exercise on rational languages.	David A. Madore	2016-11-29	2	-0/+228
\|
*	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	4	-1/+116
\|
*	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
\|