What is a regular expression in automata?
What is a regular expression in automata? A regular expression can be defined as a language or string accepted by a finite automata. We know that a finite automata consists of five touples {Q, Σ, δ, q0, F}. Among them a Regular Expression is a string on Σ, i.e. it Read more…