A Review Paper on Generating Regular Language Using Regular Expression

EasyChair Preprint no. 7671

Abstract

Interesting Languages are very certainly infinite, yet they must be described in some finite way. One technique is to use string operations to show how string operations or the language itself can be created from simpler strings or how set operations can be used to construct the language itself from simpler languages. Another option is to define an algorithm for determining. RL are simple language we explore in this study,  they may be produced from one-element languages by repeating certain basic operations a finite number of times. They're also the ones that can be recognized by finite automata (FA). A basic computer machine with significantly limited memory. We'll create a program that will build a collection of Regular language based on the regular expression provided by the user. Regular Languages are the most restrictive sorts of languages that finite automata can understand.

Keyphrases: DFA NFA, finite automata, regular expressions, regular language, Theory of Computations

@Booklet{EasyChair:7671,
  author = {Ruchita Chaudhari and Aditya Bhosale and Ashish Biradar and Kshitij Bisen and Chetan Chaudhari},
  title = {A Review Paper on Generating Regular Language Using Regular Expression},
  howpublished = {EasyChair Preprint no. 7671},

  year = {EasyChair, 2022}}