Regular Expression (RE) in TOC | Finite Automata| Regular language | L-3

Описание: Regular Expression (RE) in TOC | Finite Automata| Regular language



Previous Lecture:
   • Regular Expression (RE) in TOC | Finite Au...  


The language accepted by Finite Automata (FA) are represented by simple expression is called as
Regular Expression
.
Formal Definition of Regular Expression:
Let
Σ be a given alphabet. Then
1. 𝜙,𝜖, and 𝑎 ∈ Σ are all regular expression. These are called primitive regular expression.
2. If 𝑟1, 𝑟2 are regular expressions, then 𝑟1 + 𝑟2, 𝑟1. 𝑟2, 𝑟1∗
and ( 𝑟1) are also regular expressions.
3. A string is a regular expression if and only if it can be derived from the primitive regular
expression by a finite number of applications of the rules in (2).
Example of some Basic Regular expressions:

conversation of Regular Expression to Finite Automata
RE to NFA to DFA to MDFA
Obtained minimized DFA
-Obtained NDA
Obtained DFA

By @cseacademyahmadsir

⭐ Courses Playlist ⭐

🔗SYSTEM PROGRAMMING (SP):    • SYSTEM PROGRAMMING (SP)  

🔗COMPILER DESIGN | COMPILER | LANGUAGE PROCESSOR:    • COMPILER DESIGN | COMPILER | LANGUAGE PROC...  

🔗COMPILER DESIGN | COMPILER | LANGUAGE PROCESSOR:    • COMPILER DESIGN | COMPILER | LANGUAGE PROC...  

🔗DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM:    • DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| A...  

🔗Computer Architecture and Digital System:    • Computer Architecture and Digital System  

🔗COMPUTER GRAPHICS (CG) BY. AHMAD SIR:    • COMPUTER GRAPHICS (CG) BY. AHMAD SIR  

#automata
#automatatheory
#regularexpressions
#finiteautomata
#dfa
#nfa