Mastering Regular Expressions in TOC: Language Strings of Exactly 2 Characters 🔍

Regular Expression (RE) in TOC | Finite Automata| Regular language



Previous Lecture:
https://youtu.be/2tHGdpM_esg


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): https://www.youtube.com/playlist?list=PLS6nugESt9lIGSB_qxapdJh46j_5Hwhlq

🔗COMPILER DESIGN | COMPILER | LANGUAGE PROCESSOR: https://www.youtube.com/playlist?list=PLS6nugESt9lLXiC2WFznm4Gly6dykw5Oo

🔗COMPILER DESIGN | COMPILER | LANGUAGE PROCESSOR: https://www.youtube.com/playlist?list=PLS6nugESt9lLXiC2WFznm4Gly6dykw5Oo

🔗DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: https://www.youtube.com/playlist?list=PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf

🔗Computer Architecture and Digital System: https://www.youtube.com/playlist?list=PLS6nugESt9lKerCOnI48acy6hwmEJvtEG

🔗COMPUTER GRAPHICS (CG) BY. AHMAD SIR: https://www.youtube.com/playlist?list=PLS6nugESt9lIhGBQstlBiRjIgjC_us7-V

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