<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework for proving facts about formal languages in general and regular expression operators in particular. In this article, two quantifiers are defined and their properties are shown: <italic>m</italic> to <italic>n</italic> occurrences (or the union of a range of powers) and optional occurrence. Although optional occurrence is a special case of the previous operator (0 to 1 occurrences), it is often defined in regex applications as a separate operator - hence its explicit definition and properties in the article. Notation and terminology were taken from [13].</p></abstract>

This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework for proving facts about formal languages in general and regular expression operators in particular. In this article, two quantifiers are defined and their properties are shown: m to n occurrences (or the union of a range of powers) and optional occurrence. Although optional occurrence is a special case of the previous operator (0 to 1 occurrences), it is often defined in regex applications as a separate operator - hence its explicit definition and properties in the article. Notation and terminology were taken from [13].

Regular Expression Quantifiers — <italic>m</italic> to <italic>n</italic> Occurrences

Formalized Mathematics

Regular Expression Quantifiers —  to  Occurrences

This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework...

Regular Expression Quantifiers — m to n Occurrences

Data publikacji: 09 cze 2008

Zakres stron: 53 - 58

DOI: https://doi.org/10.2478/v10037-007-0006-7

This content is open access.