1 / 17

COT 4210 Lecture Notes - 3

COT 4210 Lecture Notes - 3. By Njegos and Monika. R is a regular expression if R is. a Є Σ , a for some a in the alphabet Σ . ε Ø R1 U R2, where R1 and R2 are regular expression R1o R2, where R1 and R2 are regular expressions R1*, where R1 is a regular expression.

ruby
Download Presentation

COT 4210 Lecture Notes - 3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. COT 4210 Lecture Notes - 3 By Njegos and Monika

  2. R is a regular expression if R is • aЄΣ, a for some a in the alphabet Σ. • ε • Ø • R1 U R2, where R1 and R2 are regular expression • R1o R2, where R1 and R2 are regular expressions • R1*, where R1 is a regular expression

  3. If A1 and A2 are regular then • A1 U A2 • A1 o A2 • A1* All are regular too.

  4. 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

  5. N1 U N2 N ε N1 ε N2

  6. A1* ε ε ε

  7. 0 U 1 0 ε ε 1

  8. (0 U 1)* ε 0 ε ε ε 1 ε

  9. 0 (0 U 1)* 0 ε 0 ε ε 0 0 ε ε ε ε 1 ε

  10. 0 U 0 (0 U 1)* 0 0 ε ε 0 ε ε ε 0 0 ε ε ε ε 1 ε

  11. Qj R4 Qi R3 R1 Qrip R1 R2* R3 U R4 Qj Qi

  12. GNFA stands for Generalized Nondeterministic Finite Automaton. GNFA are simply nondeterministic finite automaton wherein the transition arrows may have any regular expressions as labels, instead of only members of the alphabet. GNFA

  13. 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. Restricted GNFA

  14. EXAMPLE 0 1 0 1 ε Q2 Q3 S Q1 0 1 ε F

  15. After Ripping Q3 0 1 ε Q2 S Q1 1 01*0 ε F

  16. 10*1 U 01*0 R2 0*1 S Q2 0* 10* R3 R4 F 0*1(10*1 U 01*0)*10* U 0*

  17. If we have n states in DFA then restricted GNFA is going to have (n+2) states.

More Related