It has been widely-known that context-sensitive language cannot be modeled by finite state automata. However, phonological rules, which are context-sensitive, can be modeled by finite state automata, as discussed in Daniel Jurafsky's introductory book on computational linguistics. Can anyone explain the discrepancy here? Thank you!