2014•The Computer JournalRequires access

An Improved Algorithm for the Metamorphosis of Semi-Extended Regular Expressions to Deterministic Finite Automata

Ajay Kumar, Anil Kumar Verma

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Concatenation (mathematics), Regular expression, Nondeterministic finite automaton, Intersection (aeronautics), Finite-state machine, Algorithm, Deterministic finite automaton, Automaton