<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>This is the second article on regular expression quantifiers. [4] introduced the quantifiers <italic>m</italic> to <italic>n</italic> occurrences and optional occurrence. In the sequel, the quantifiers: at least <italic>m</italic> occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7].</p><p>MML identifier: FLANG 3, version: 7.8.05 4.89.993</p></abstract>

This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7].MML identifier: FLANG 3, version: 7.8.05 4.89.993

Regular Expression Quantifiers - at least <italic>m</italic> Occurrences

Formalized Mathematics

Regular Expression Quantifiers - at least  Occurrences

This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the...

Regular Expression Quantifiers - at least m Occurrences

Data publikacji: 20 mar 2009

Zakres stron: 29 - 33

DOI: https://doi.org/10.2478/v10037-008-0005-3

This content is open access.