Development of An Efficient Tool to Convert Regular Expressions to NFA

Journal Title: Journal of Emerging Computer Technologies - Year 2021, Vol 1, Issue 2

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.

Authors and Affiliations

Mustafa BATAR, Kökten BİRANT

Keywords

Related Articles

Practical Evaluation on Serious Games in Education

The arrival of the new learning methodologies is in response to the reality: new generations should learn in a different way. The so-called "Millennials" are looking for another kind of stimulus. Discussions for moderniz...

Coding Schemes for DNA Patient Record Processing to Electronic Health Records Systems

Lately, electronic health record (EHR) systems became very popular in medical technology. The main aim of such systems is to perform a digital version of a patient’s paper chart. EHRs are real-time, patient-centered reco...

Providing Priority Degrees for the Challenges of Cloud-Based Outsource Software Development Projects via Fuzzy Analytic Hierarchy Process Methods

Cloud-based outsource software development (COSD) is a fairly new and popular software development methodology, which is enabled by the enormous growth of the cloud computing services in the last decade. The key idea of...

Development of An Efficient Tool to Convert Regular Expressions to NFA

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” crea...

Face Recognition Based Multifunction IoT Smart Mailbox

The abundance and variety of the Internet of Things (IoT) applications in the recent couple of years has reach a new record. From smart home, smart traffic, smart city, to industry, logistics and agriculture IoT applicat...

Download PDF file
  • EP ID EP706087
  • DOI -
  • Views 128
  • Downloads 0

How To Cite

Mustafa BATAR, Kökten BİRANT (2021). Development of An Efficient Tool to Convert Regular Expressions to NFA. Journal of Emerging Computer Technologies, 1(2), -. https://europub.co.uk/articles/-A-706087