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

	Commit message (Collapse)	Author	Age	Files	Lines
*	Reread and rework introduction to computability.	David A. Madore	2017-11-03	1	-125/+184
\|
*	Reread section on formal grammars. Rewrite proof that algebraic languages ↵	David A. Madore	2017-11-03	1	-51/+131
\| \| \| \|	are decidable.
*	More clarifications.	David A. Madore	2017-11-02	1	-13/+20
\|
*	Various clarifications on context-free grammars.	David A. Madore	2017-11-02	1	-97/+146
\|
*	Typographic logic.	David A. Madore	2017-11-02	1	-6/+6
\|
*	Clarify what \footnotesize means.	David A. Madore	2017-11-02	1	-0/+5
\|
*	Minor clarifications on formal grammars.	David A. Madore	2017-11-01	1	-3/+11
\|
*	Some remarks on degenerate cases.	David A. Madore	2017-11-01	1	-2/+27
\|
*	Primary terminology is "minimal" automaton, not "canonical".	David A. Madore	2017-11-01	1	-5/+5
\|
*	Change acronym for incomplete automata to "DFAi" with lowercase i.	David A. Madore	2017-11-01	1	-36/+36
\| \| \| \|	Is this really a good idea? Maybe not.
*	Rework various comments (especially on regular expressions).	David A. Madore	2017-11-01	1	-68/+107
\|
*	Add another example of state elimination (limited-depth balanced parentheses).	David A. Madore	2017-11-01	2	-0/+81
\|
*	An intuitive explanation of the pumping lemma's uses.	David A. Madore	2017-11-01	1	-0/+12
\|
*	Reread sections on recognizable languages: various updates, clarifications, ↵	David A. Madore	2017-10-31	1	-49/+86
\| \| \| \|	fixes.
*	Add general intro blurb.	David A. Madore	2017-10-31	1	-7/+64
\|
*	Reread sections on automata: various updates, clarifications, fixes.	David A. Madore	2017-10-30	1	-118/+151
\|
*	Compatibility with older TeXlive.	David A. Madore	2017-10-30	1	-0/+1
\|
*	Introduction and clarifications on context-free grammars.	David A. Madore	2017-10-30	1	-17/+82
\|
*	Illustration for the pumping lemma.	David A. Madore	2017-10-30	1	-0/+35
\|
*	Remark on various equivalences of rational expressions.	David A. Madore	2017-10-29	1	-10/+55
\|
*	Clarifications on how to decide equivalence of automata.	David A. Madore	2017-10-29	1	-1/+23
\|
*	Clarifications on the state elimination algorithm.	David A. Madore	2017-10-29	1	-19/+52
\|
*	Avoid widowing section titles.	David A. Madore	2017-10-29	1	-1/+1
\|
*	Clarifications on why various kinds of automata are introduced, and on ↵	David A. Madore	2017-10-29	1	-35/+106
\| \| \| \|	Glushkov's construction.
*	Describe the Thompson automaton of a regular expression.	David A. Madore	2017-10-29	3	-8/+293
\|
*	More additions to index.	David A. Madore	2017-10-29	1	-3/+3
\|
*	Clarify course curriculum.	David A. Madore	2017-10-29	1	-5/+11
\|
*	More additions to index.	David A. Madore	2017-10-29	1	-3/+3
\|
*	Minor additions to titles and index.	David A. Madore	2017-10-28	1	-5/+6
\|
*	Use more space on page (reduce margins) by using geometry package.	David A. Madore	2017-10-28	1	-0/+1
\|
*	Add example illustrating Glushkov's construction.	David A. Madore	2017-10-28	5	-1/+159
\|
*	More remarks on Glushkov automata.	David A. Madore	2017-10-27	1	-3/+20
\|
*	Glushkov automata: define properly.	David A. Madore	2017-10-27	1	-11/+52
\|
*	Rewrite stability of recognizable languages using Glushkov's construction.	David A. Madore	2017-10-27	1	-81/+322
\|
*	Clarification of how automata with spontaneous transitions work.	David A. Madore	2017-10-27	1	-45/+22
\|
*	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
\|
*	Comments on exam. [Forgotten commit, changes made on 2017-05-28.]	David A. Madore	2017-10-19	1	-3/+71
\|
*	Spello.	David A. Madore	2017-05-28	1	-1/+1
\|
*	Suggest two options on how to solve the last question.exam-20170330	David A. Madore	2017-03-25	1	-3/+38
\|
*	Take into account Antoine's remarks.	David A. Madore	2017-03-22	1	-31/+35
\|
*	Add missing transition on Thompson automaton.	David A. Madore	2017-03-22	2	-27/+29
\|
*	Put Kleene's star in exponent.	David A. Madore	2017-03-18	1	-4/+4
\|
*	Take into account Akim's remarks.	David A. Madore	2017-03-18	1	-12/+6
\|
*	Final exercise (computability).	David A. Madore	2017-03-17	1	-3/+69
\|
*	Another exercise (on various kinds of languages).	David A. Madore	2017-03-17	1	-0/+174
\|