The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds.

Karl Bringmann Allan Grønlund Marvin Künnemann Kasper Green Larsen

Published in: CoRR (2023)

Keyphrases

lower bound
upper bound
branch and bound
real time
branch and bound algorithm
finite state automata
website
case study
dynamic environments
lower and upper bounds