A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group.
Yinfeng ZhuPublished in: CoRR (2024)
Keyphrases
- upper bound
- lower bound
- cellular automata
- worst case
- objective function
- group members
- branch and bound
- sample complexity
- computational complexity
- finite state machines
- lattice gas
- real time
- error probability
- linear functions
- lower and upper bounds
- branch and bound algorithm
- optimal solution
- multi agent
- genetic algorithm
- machine learning
- neural network