- TuTh 12:30-13:50 in the Comp Ling Lab in SBS N250
- Office Hours TBD
- Syllabus
- Useful Links for github, markdown, LaTeX, and Haskell
- Today we introduced the course and went over the syllabus.
- {strings, trees} x {acceptors, transducers} x {determinism, non-determinism} + algebraic classifications + natural language phonology, morphology, syntax
- intro slides
- Supplemental readings (not required, but may provide useful perspective)
- Cheng 2015 on abstraction
- Cormen 2013 on algorithms
- Garey and Johnson 1979 on time complexity
- Stabler 2019 on the importance of trees for syntax
- Graf 2022 on subregular linguistics
- Heinz 2025 on subregular phonology
- Bird and Gibbons 2020 p.xv: "Algorithms in real life are a good deal more intricate than the ones presented in this book. The shortest-path algorithm in a satellite navigation system is a good deal more complicated than a shortest-path algorithm as presented in a textbook on algorithm design. Real-life algorithms have to cope with the problems of scale, with the effective use of a computer’s hardware, with user interfaces, and with many other things that go into a well-designed and useful product. None of these aspects is covered in the present book, nor indeed in most books devoted solely to the principles of algorithm design."
- For Thursday:
- Review chapter 1 of Sanella et al. 2021 on sets, relations, and functions.
- Please make sure you have a github account set up and send me your username so I can add you to the "Compling2-Spring2026-SBU" github organization.
- Install Haskell using GHCup. Instructions are here. If you need assistance, please let us know asap. Windows users may want to install the Windows Subsystem for Linux or set up a Virtual Machine with a Linux distribution (such as Ubuntu) running on it. Instructions for how to install Ubuntu on a virtual machine are here.
- How do you know if you were able to install Haskell successfully?
Open a terminal window, and at the command line, do the following.
$ ghci GHCi, version 9.2.8: https://www.haskell.org/ghc/ :? for help ghci> take 5 [1 .. ] [1,2,3,4,5] ghci>
