Intersection Optimization is NP Complete

Guillaume Bonfante 1, * Joseph Le Roux 2, *
* Corresponding author
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose a method for lexical disambiguation based on polarities found in several grammatical formalisms which require multi- ples intersection of finite state automata. We then prove that there is no efficient technique to minimize the state complexity of these intersec- tions.
Document type :
Other publications
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00146671
Contributor : Guillaume Bonfante <>
Submitted on : Tuesday, May 15, 2007 - 11:12:12 AM
Last modification on : Thursday, February 7, 2019 - 2:33:38 PM
Document(s) archivé(s) le : Wednesday, April 7, 2010 - 12:15:40 AM

File

intersection.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00146671, version 1

Collections

Citation

Guillaume Bonfante, Joseph Le Roux. Intersection Optimization is NP Complete. Rapport technique. 2007. 〈hal-00146671〉

Share

Metrics

Record views

246

Files downloads

94