Discussion Details
| Title: | Finite State Automata & Context-sensitive Language |
| Submitter: | Jiun-Shiung Wu |
| Description: | 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! |
| Date Posted: | 02-Jul-2007 |
| Linguistic Field(s): | Computational Linguistics |
| LL Issue: | 18.1982 |
| Posted: | 02-Jul-2007 |
