Computational Complexity of NFA Minimization for Finite and Unary Languages.
Hermann GruberMarkus HolzerPublished in: LATA (2007)
Keyphrases
- xml data
- computational complexity
- finite state automata
- query language
- relational databases
- expressive power
- pairwise
- np complete
- objective function
- text summarization
- language independent
- finite number
- low complexity
- decision problems
- special case
- computationally efficient
- string matching
- high computational complexity
- databases
- cross lingual
- np hard
- query translation
- language identification
- learning from positive data
- bit rate
- worst case
- edit distance
- computational cost
- statistical machine translation
- monadic datalog