Lower Bounds for the Transition Complexity of NFAs.

Michael Domaratzki Kai Salomaa

Published in: MFCS (2006)

Keyphrases

lower bound
upper bound
worst case
complexity measures
branch and bound
space complexity
average case complexity
neural network
regular expressions
upper and lower bounds
lower bounding
objective function
online learning
branch and bound algorithm
randomly generated problems
transition model