1 / 4

Regex to NFA Conversion Exercise for Programming Students

This exercise module covers the conversion of regular expressions to non-deterministic finite automata (NFA) and regular grammars (RG). Students will practice transforming regex to NFA and back while creating minimum deterministic finite automata (DFA). The specific regex pattern to work on is (a+b)*(c+de*)*f.

bowmanjennifer
Download Presentation

Regex to NFA Conversion Exercise for Programming Students

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. ExerciseRE->NFA->RG->RE Module 05.2COP4020 – Programming Language Concepts Dr. Manuel E. Bermudez

  2. Exercise: RE->NFA->RG->RE Done Soon RGR RGL Minimum DFA RE NFA DFA

  3. (a+b)*(c+de*)*f Exercise: RE->NFA->RG->RE.

  4. Exercise: RE->NFA->RG->REHint: midterm Done Soon RGR RGL Minimum DFA RE NFA DFA

More Related