Development of An Efficient Tool to Convert Regular Expressions to NFA

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Journal of Emerging Computer Technologies
Volume:1 Issue:2
Development of An Efficient Tool to Convert Regular Expressions to NFA

Development of An Efficient Tool to Convert Regular Expressions to NFA

Authors : Mustafa BATAR, Kökten BİRANT

Pages : 38-43

View : 141 | Download : 27

Publication Date : 2021-12-31

Article Type : Research Paper

Abstract :In the computing theory, while the term “Language” specifies the string set, the term “Regular Expressions” means the notation that builds, creates and generates these languages. Also, the term “Regular Expressions” creates the characters that structure and compose, which refers to the given strings, in order to search patterns for sample matching. In this context, this article tries to show how to convert “Regular Expressions” that is made up of characters into Nondeterministic Finite Automata (NFA), which is a character matching and character searching tool, by giving related algorithms and methods with their explanations in detail. Moreover, in this study, a new and efficient tool has been designed and developed in order to convert regular expressions to NFA. By the contribution of this application, an original conversion tool will have been gained in the computation area for benefiting it. As a natural result of this, an original NFA modelling tool will have been placed in the literature.
Keywords : Computing theory, regular expressions, NFA, modelling

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.