Upper Bound on Syntactic Complexity of Suffix-Free Languages.
Janusz A. BrzozowskiMarek SzykulaPublished in: DCFS (2015)
Keyphrases
- upper bound
- worst case
- lower bound
- branch and bound algorithm
- syntactic and semantic dependencies
- computational complexity
- databases
- lower and upper bounds
- natural language
- computational cost
- cross lingual
- space complexity
- language independent
- database systems
- machine learning
- context free grammars
- error probability
- data sets