1. Hulden, M.: Foma: a finite-state compiler and library. In: EACL 2009 Proceedings, pp. 29–32 (2009)
2. Koskenniemi, K.: Two-level morphology: A general computational model for word-form recognition and production. Publication 11, University of Helsinki, Department of General Linguistics, Helsinki (1983)
3. Karttunen, L., Koskenniemi, K., Kaplan, R.M.: A compiler for two-level phonological rules. In: Dalrymple, M., Kaplan, R., Karttunen, L., Koskenniemi, K., Shaio, S., Wescoat, M. (eds.) Tools for Morphological Analysis. CSLI, Palo Alto (1987)
4. Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)
5. Beesley, K., Karttunen, L.: Finite-State Morphology. CSLI, Stanford (2003)