Numerical upper bounds on growth of automaton groups.
Jérémie BrieusselThibault GodinBijan MohammadiPublished in: Int. J. Algebra Comput. (2022)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- branch and bound
- tight bounds
- worst case
- sample size
- efficiently computable
- tight upper and lower bounds
- upper bounding
- error probability
- growth rate
- finite automata
- similar objects
- finite state automata
- finite state machines
- deterministic finite automata
- branch and bound algorithm
- sensitivity analysis
- scheduling problem