# Lec03RE - may have any regular expressions as labels,...

This preview shows pages 1–17. Sign up to view the full content.

COT 4210 Lecture Notes - 3 By Njegos and Monika

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
R is a regular expression if R is 1.aЄΣ, a for some a in the alphabet Σ. 2.ε 3.Ø 4.R1 U R2, where R1 and R2 are regular expression 5.R1o R2, where R1 and R2 are regular expressions 6.R1*, where R1 is a regular expression
If A1 and A2 are regular then A1 U A2 A1 o A2 A1* All are regular too.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Regular Expression 0*10*:- zero or more 0’s followed by one 1 and followed by any number of 0’s or no 0 (0 U ε) 1*:- 0 followed by any number of 1’s or any number of 1’s 1* Ø :- Take zero or more 1’s and concatenated by empty set. 1* Ø = Ø Ø*:- {ε} ; Empty string
N1 N2 ε ε N N1 U N2

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
A1* ε ε ε
0 1 ε ε 0 U 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
0 1 ε ε (0 U 1)* ε ε ε
0 1 ε ε ε ε 0 ε ε ε ε 0 0 (0 U 1)* 0

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
0 1 ε ε ε ε 0 ε ε ε ε 0 ε ε 0 0 U 0 (0 U 1)* 0
Qj Qrip R4 R3 R1 Qi Qi Qj R1 R2* R3 U R4

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
GNFA GNFA stands for Generalized Nondeterministic Finite Automaton. GNFA are simply nondeterministic finite automaton wherein the transition arrows

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: may have any regular expressions as labels, instead of only members of the alphabet. Restricted GNFA The start state has transition arrows going to every other state but no arrows coming in from any other state. There is only a single accept state, and it has arrows coming in from every other state but no arrows going to any other state. Accept state is not the same as the start state. Except for the start and accept states, one arrow goes from every state to every other state and also from each state to itself. 1 1 Q1 Q2 Q3 F S 1 EXAMPLE 1 1 Q1 Q2 F S After Ripping Q3 01*0 0*1 S Q2 F 10* 10*1 U 01*0 0* R2 R3 R4 0*1(10*1 U 01*0)*10* U 0* If we have n states in DFA then restricted GNFA is going to have (n+2) states....
View Full Document

## This note was uploaded on 09/16/2011 for the course COT 4210 taught by Professor Staff during the Spring '08 term at University of Central Florida.

### Page1 / 17

Lec03RE - may have any regular expressions as labels,...

This preview shows document pages 1 - 17. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online