1 / 1

Understanding Regular Expressions in Sigma Alphabet

Learn the definition and rules of regular expressions in a given alphabet Sigma. Discover how to derive primitive expressions and apply various operations like union, concatenation, and closure.

rajah-stone
Download Presentation

Understanding Regular Expressions in Sigma Alphabet

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. Definition of re Let Sigma be a given alphabet. Then 1. , , and a  are all regular expressions. These are called primal regular expressions. 2. If r1 and r2 are regular expressions, so are r1 + r2, r1. r2, r1*, and (r1). 3. A string is a regular expression if and only if it can be derived from the primitive regular expressions by a finite number of applications of rules in (2). union of two re’s is a re concatenation of two re’s is a re closure of a re’s is a re a re may be parenthesized

More Related