Scribd
Upload
49 views5 pages

NFA/DFA To Regular Expression (Part-4) : DR Raheel Siddiqi

This document provides examples of converting deterministic finite automata (DFAs) and non-deterministic finite automata (NFAs) to regular expressions (REs). It gives a DFA with 3 states labeled 1, 2 and 3 and shows transitions between them as an example of converting a DFA to RE. It also shows an NFA with 3 states labeled q0, q1, and q2 as an example of converting an NFA to RE.

Uploaded by

hashir mahboob
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
49 views5 pages

NFA/DFA To Regular Expression (Part-4) : DR Raheel Siddiqi

This document provides examples of converting deterministic finite automata (DFAs) and non-deterministic finite automata (NFAs) to regular expressions (REs). It gives a DFA with 3 states labeled 1, 2 and 3 and shows transitions between them as an example of converting a DFA to RE. It also shows an NFA with 3 states labeled q0, q1, and q2 as an example of converting an NFA to RE.

Uploaded by

hashir mahboob
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

NFA/DFA to Regular Expression

(part-4)
Dr Raheel Siddiqi
Example #4
Convert this DFA to RE.

1 2 3
Example #5
Convert this
NFA to RE.

q0 q1 q2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy