Tight Bounds for NFA to DFCA Transformations for Binary Alphabets.

Cezar Câmpeanu Andrei Paun

Published in: CIAA (2004)

Keyphrases

tight bounds
upper bound
lower bound
non binary
data sets
objective function
string matching
artificial intelligence
regular expressions
binary data
finite state automata
gray code