Abstract
Semi-extended regular expressions are regular expressions with intersection, union, concatenation and Kleene closure operators. The aim of this paper is the metamorphosis of semi-extended regular expressions to deterministic finite automata. The proposed algorithm is based on the follow-positions of symbols present in the semi-extended regular expression. Comparison demonstrates that the deterministic finite automaton generated using the proposed algorithm is smaller than the earlier existing approaches in the literature. Finally, to expound upon this metamorphosis, we provide the reader with numerical examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
