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.
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.
Birincil Dil | İngilizce |
---|---|
Konular | Yazılım Testi, Doğrulama ve Validasyon |
Bölüm | Araştırma Makaleleri |
Yazarlar | |
Yayımlanma Tarihi | 31 Aralık 2021 |
Yayımlandığı Sayı | Yıl 2021 Cilt: 1 Sayı: 2 |
Journal of Emerging Computer Technologies
is indexed and abstracted by
Index Copernicus, ROAD, Academia.edu, Google Scholar, Asos Index, Academic Resource Index (Researchbib), OpenAIRE, IAD, Cosmos, EuroPub, Academindex
Publisher
Izmir Academy Association
www.izmirakademi.org