Resolving non-determinism in NFA
Ivan Stoyanov, Stoyan Bonev · 2003
Abstract: The paper describes the authors ’ experience in simulating non-deterministic finite state automata (NFA) using concurrent programming. The non-determinism is resolved simultaneously by activating a separate thread for all possible transition paths. The approach under discussion may be used to implement specific recognizers in the practice of language processors writing.