A simple way to construct NFA with fewer states and transitions.

Published in: ACM Southeast Regional Conference (2004)

Keyphrases

neural network
expert systems
state transition
state transitions
black box
highly reliable
deterministic finite automata
artificial intelligence
multi agent
search algorithm
computational complexity
preprocessing
lower bound
hidden markov models
dynamic programming