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.
Digital Object Identifier (DOI)
Kumar, Ajay and Kumar Verma, Anil
"A Novel Algorithm for the Conversion of Parallel Regular Expressions to Non-deterministic Finite Automata,"
Applied Mathematics & Information Sciences: Vol. 08:
1, Article 11.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss1/11