A Very Short and Fast intro to XFST And its applications to linguistics. This has three units: Exercise 1: Make graphs of finite-state automata Exercise 2: How to test a transliterator Exercise 3: Using lexc to compose morphologies