摘要：There is a long and fertile interaction between research on finitestate methods and the mathematics of language: many central results in mathematical linguistics are based on finite-state models such as au_tomata and grammars,and mathematical linguistics in turn has laid the foundations for the application of finite-state methods in natu_ral language processing (NLP). One important outcome of the cross?semination between the two fields is the characterisation of adequate classes of string languages and tree languages for linguistic modelling.
