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

	Commit message (Collapse)	Author	Age	Files	Lines
*	Clarify statement on busy-beaver function.	David A. Madore	2017-01-30	1	-5/+6
\|
*	An exercise on Kleene's algorithm.	David A. Madore	2017-01-30	1	-0/+88
\|
*	Fix/clarification in answer to an exercise.	David A. Madore	2017-01-30	1	-1/+2
\|
*	An exercise on finite automata.	David A. Madore	2017-01-27	1	-0/+181
\|
*	Another exercise on computability (decidable iff range of an increasing ↵	David A. Madore	2017-01-27	1	-0/+60
\| \| \| \|	computable function).
*	Another exercice on decidability.	David A. Madore	2017-01-27	1	-2/+69
\|
*	Busy beaver function.	David A. Madore	2017-01-27	1	-0/+65
\|
*	Union, intersection, concatenation and star of decidable vs. semi-decidable ↵	David A. Madore	2017-01-27	1	-0/+97
\| \| \| \|	languages.
*	Write a sample exercice on computability.	David A. Madore	2017-01-27	1	-0/+197