




A Novel Algorithm for the Conversion of Parallel Regular Expressions to Nondeterministic Finite Automata 

PP: 95105 

Author(s) 

Ajay Kumar,
Anil Kumar Verma,


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 nondeterministic finite
automaton using the novel algorithm. In the earlier existing approaches, the number of states of the nondeterministic finite automaton
in the worst case is equal to 22r−3C. 




