A Novel Algorithm for the Conversion of Parallel Regular Expressions to Non-deterministic Finite Automata
Ajay Kumar, Anil Kumar Verma · Applied Mathematics & Information Sciences · 2013
Abstract: The aim of the paper is to concoct a novel algorithm for the metamorphosis of parallel regular expressions to ε-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, 2 m+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 2 2|r|−3C.