1. Partee et al. (1993: ch. 1-3) give a gentle introduction to sets, pairs, relations, functions, and
2. strings. Hopcroft et al. (2008: ch. 2) formalizes finite acceptors, though they eschew both trans
3. ducers and weights. Comparable formalizations of WFSTs are given by Roark and Sproat (2007: ch. 1)
4. guages, and regular expressions. Jurafsky and Martin (2009: ch. 2) and Eisenstein (2019: ch. 9)