Nota : Ceci est la version 2010鈥�2011 de l鈥檃nnuaire 茅lectronique. Veuillez mettre 脿 jour l鈥檃nn茅e dans la barre d鈥檃dresse de votre navigateur pour une version plus r茅cente de cette page, ou cliquez聽ici pour consulter l'annuaire la plus r茅cente.
Vue d'ensemble
Math茅matiques et Statistiques (Sci) : Calculability on an infinite abacus is compared with recursive functions and Turing machines. Categorial, context-free, generative and transformational grammars are studied for formal and natural languages, with some emphasis on English and French morphology. Machines for generating and recognizing sentences are discussed.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
- Winter