•  
  •  
 

Author Country (or Countries)

India

Abstract

The aim of the paper is to concoct a novel algorithm for the metamorphosis of parallel regular expressions to e -free nondeterministic finite automata. For a given parallel regular expression r, let m be the number of symbols that occur in r and let C denote the number of concatenation operators in r. In the worst case, 2m+1 states are required for the construction of the non-deterministic finite automaton using the novel algorithm. In the earlier existing approaches, the number of states of the non-deterministic finite automaton in the worst case is equal to 22|r|−3C.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/080111

Share

COinS