Lower-bounds on the growth of power-free languages over large alphabets.
Matthieu RosenfeldPublished in: CoRR (2020)
Keyphrases
- lower bound
- upper bound
- expressive power
- power consumption
- branch and bound algorithm
- optimal solution
- branch and bound
- language independent
- objective function
- np hard
- quadratic assignment problem
- databases
- lower and upper bounds
- amino acids
- worst case
- sign language
- upper and lower bounds
- grammatical inference
- neural network