Resolving non-determinism in NFA

  • Authors:
  • Ivan Stoyanov;Stoyan Bonev

  • Affiliations:
  • American University in Bulgaria;American University in Bulgaria

  • Venue:
  • CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning
  • Year:
  • 2003
  • An adaptable FSA simulator

    CompSysTech '08 Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper describes the authors" experience in simulating nondeterministic 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.