The state complexities of some basic operations on regular languages, Theoretical Computer Science, vol.125, issue.2, pp.315-328, 1994. ,
DOI : 10.1016/0304-3975(92)00011-F
On the State Complexity of Combined Operations, Lecture Notes in Computer Science, vol.4094, pp.11-22, 2006. ,
DOI : 10.1007/11812128_3
Computers and Intractability, Freeman, 1979. ,
On the complexity of intersecting finite state automata, Proceedings 15th Annual IEEE Conference on Computational Complexity, pp.229-234, 2000. ,
DOI : 10.1109/CCC.2000.856753
Introduction to Algorithms, 1990. ,
Categorial Type Logics, Handbook of Logic and Language, 1996. ,
La sémantique dans les grammaires d'interaction, Traitement Automatique des Langues, vol.45, issue.3, pp.123-144, 2004. ,
Polarized unification grammars, Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL , ACL '06, 2006. ,
DOI : 10.3115/1220175.1220193
Robust part-of-speech tagging using a hidden Markov model, Computer Speech & Language, vol.6, issue.3, pp.225-242, 1992. ,
DOI : 10.1016/0885-2308(92)90019-Z
Tagging English text with a probabilistic model, Computational Linguistics, vol.20, issue.2, pp.155-172, 1994. ,
Coping with ambiguity and unknown words through probabilistic models, Computational Linguistics, vol.19, issue.2, pp.155-172, 1993. ,
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation, Proceedings of the 20th international conference on Computational Linguistics , COLING '04, 2004. ,
DOI : 10.3115/1220355.1220399
URL : https://hal.archives-ouvertes.fr/inria-00099886
Applying a Finite-State Intersection Grammar In: Finite-State Language Processing, MIT, 1997. ,