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

	Commit message (Collapse)	Author	Age	Files	Lines
*	Fix definition of Glushkov automaton for concatenation (when initial state ↵	David A. Madore	2021-04-21	1	-5/+6
\| \| \| \|	is final in second automaton).
*	Add another example (still equivalent) and fix a small mistake.	David A. Madore	2021-04-16	1	-0/+0
\|
*	Add a manuscript (Xournal) file with examples of automata.	David A. Madore	2021-04-16	1	-0/+0
\| \| \| \|	Glushkov automata, determinization and minimization for (a\|ab)* and a(aba)*.
*	Typo (thanks, Matthieu Rambaud).	David A. Madore	2021-03-27	1	-1/+1
\|
*	Reorganize syllabus.	David A. Madore	2021-03-22	1	-25/+21
\|
*	Forgotten commit.	David A. Madore	2020-06-15	1	-2/+3
\|
*	Prepare for compilation of final test.exam-20200612	David A. Madore	2020-06-10	2	-4/+15
\|
*	Microscopic reformulations to avoid some possible ambiguities.	David A. Madore	2020-06-05	1	-9/+9
\|
*	Yet another question (suggested by previous mistake).	David A. Madore	2020-06-05	1	-0/+24
\|
*	Fix mistake in answer (thanks, Antoine Amarilli).	David A. Madore	2020-06-05	1	-3/+3
\|
*	Clarify some answers.	David A. Madore	2020-06-04	1	-4/+6
\|
*	Date.	David A. Madore	2020-06-04	1	-1/+1
\|
*	Yet more tweaking.	David A. Madore	2020-06-04	1	-0/+12
\|
*	Yet more questions.	David A. Madore	2020-06-04	1	-0/+100
\|
*	Fix mistake.	David A. Madore	2020-06-04	1	-1/+2
\|
*	More questions.	David A. Madore	2020-06-04	1	-0/+284
\|
*	Minor changes.	David A. Madore	2020-06-04	1	-6/+6
\|
*	More questions.	David A. Madore	2020-06-04	1	-12/+382
\|
*	Test randomizer script: change uniformity rules.	David A. Madore	2020-06-04	1	-30/+30
\|
*	Write a number of multiple-choice questions.	David A. Madore	2020-06-04	1	-35/+256
\|
*	Start preparing multiple-choice test.	David A. Madore	2020-06-03	2	-0/+450
\|
*	Typo.exam-20200123	David A. Madore	2020-02-23	1	-1/+1
\|
*	Two typos (thanks, Pierre Pébereau).printed-2020	David A. Madore	2020-01-23	1	-2/+2
\|
*	More re-reading.	David A. Madore	2020-01-21	1	-1/+9
\|
*	Re-read test and answers.	David A. Madore	2020-01-21	1	-63/+87
\|
*	Number of pages.	David A. Madore	2020-01-21	1	-1/+1
\|
*	Clarification.	David A. Madore	2020-01-21	1	-5/+6
\|
*	Write answer to exercise on CFGs.	David A. Madore	2020-01-21	1	-5/+100
\|
*	Finish writing answers to exercise on unary languages.	David A. Madore	2020-01-21	1	-11/+217
\|
*	Write answer to first exercise.	David A. Madore	2020-01-21	1	-0/+40
\|
*	Front page.	David A. Madore	2020-01-21	1	-3/+7
\|
*	Improve wording in various places.	David A. Madore	2020-01-21	1	-9/+10
\|
*	Third exercise on CFGs.	David A. Madore	2020-01-21	1	-0/+30
\|
*	Exercise on state elimination.	David A. Madore	2020-01-21	1	-1/+31
\|
*	Update exercise on unary languages.	David A. Madore	2020-01-21	1	-5/+39
\|
*	Start writing exam: an exercise on finite automata.	David A. Madore	2020-01-20	1	-0/+174
\|
*	Add two exercises from last year's exam (plus, update index very slightly).printed-2019	David A. Madore	2019-10-22	1	-2/+294
\|
*	Continue writing test.exam-20190328	David A. Madore	2019-03-26	1	-13/+78
\|
*	Start writing an exam.	David A. Madore	2019-03-26	1	-0/+193
\|
*	Take into account Antoine's remarks, but they may be too late.exam-20190205	David A. Madore	2019-02-03	1	-26/+31
\|
*	Take into account Olivier's remarks on exam.	David A. Madore	2019-02-01	1	-20/+25
\|
*	Prepare for printing.	David A. Madore	2019-01-31	1	-11/+11
\|
*	Cursory proofreading.	David A. Madore	2019-01-31	1	-7/+12
\|
*	Missing words (thanks, Michaël).	David A. Madore	2019-01-29	1	-2/+2
\|
*	Write answers to exercise on CFGs.	David A. Madore	2019-01-28	1	-8/+204
\|
*	Add an intermediate question to make exercise easier.	David A. Madore	2019-01-24	1	-20/+25
\|
*	Add an exercise on CFGs.	David A. Madore	2019-01-24	1	-1/+78
\|
*	Answers to exercise about computability.	David A. Madore	2019-01-23	1	-0/+23
\|
*	Adopt convention of underlining the epsilon symbol in regexps.	David A. Madore	2019-01-23	1	-10/+10
\|
*	A very silly exercise on computability.	David A. Madore	2019-01-23	1	-0/+28
\|