Completely Reachable Automata: A Polynomial Solution and Quadratic Bounds for the Subset Reachability Problem.
Robert FerensMarek SzykulaPublished in: CoRR (2022)
Keyphrases
- constrained minimization
- computational complexity
- pairwise
- cellular automata
- mathematical model
- optimal solution
- linear equations
- transitive closure
- optimization method
- closed form
- upper bound
- integer programming
- finite state machines
- state space
- lower bound
- approximation methods
- theoretical guarantees
- objective function
- lattice gas