A Technique for Proving Lower Bounds on the Size of Sweeping Automata.

Published in: J. Autom. Lang. Comb. (2009)

Keyphrases

lower bound
upper bound
objective function
running times
branch and bound
cellular automata
neural network
finite state
branch and bound algorithm
optimal solution
np hard
data structure
lower and upper bounds
small size
finite automata
database
lattice gas