Login / Signup
Lower Bounds on the Size of Sweeping Automata
Michael Sipser
Published in:
STOC (1979)
Keyphrases
</>
lower bound
upper bound
np hard
branch and bound
lower and upper bounds
lower bounding
probabilistic automata
objective function
randomly generated problems
upper and lower bounds
regular expressions
cellular automata
worst case
branch and bound algorithm
running times
computational complexity
optimal solution