A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.
Marie-Pierre BéalMikhail V. BerlinkovDominique PerrinPublished in: Int. J. Found. Comput. Sci. (2011)
Keyphrases
- upper bound
- lower bound
- linear functions
- computational complexity
- clustering algorithm
- cellular automata
- worst case
- co occurrence
- hierarchical clustering
- neural network
- data points
- word recognition
- finite state
- branch and bound algorithm
- memory requirements
- branch and bound
- n gram
- word sense disambiguation
- cluster analysis
- lower and upper bounds
- finite automata
- objective function