finite-state automata

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Context-free grammars, part 1Computational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
2. 2▶Multiple center embedding, the pumping lemma, and limitations of finite-state automataComputational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
3. 3▶Finite-state transducersComputational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
4. 4▶Introduction to psycholinguistic methods, part 3: readingComputational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
5. 5▶Introduction to psycholinguistic methods, part 4: neural methodsComputational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
6. 6▶Introduction to psycholinguistic methods, part 2: the visual world paradigmComputational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
7. 7▶Introduction to psycholinguistic methods, part 1Computational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
8. 8▶Finite-state models, regular languages, English syntax, and strong vs. weak generative capacityComputational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
9. 9▶Regular expressions and their relation with finite-state modelsComputational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
   +Watch later
10. 10▶Introductory language models, part 1Computational Psycholinguistics – MIT (Undergraduate/Graduate course)Notes
    +Watch later