A family of NFAs which need 2n- deterministic states.

Kazuo Iwama Akihiro Matsuura Mike Paterson

Published in: Theor. Comput. Sci. (2003)

Keyphrases

deterministic finite automata
regular expressions
finite state automaton
pattern matching
black box
state transition
special case
state variables
database
artificial intelligence
finite state machines
finite automata
relaxation algorithm
fully observable
objective function
xml schema