# Regular Expression Quantifiers - at least m Occurrences

Formalized Mathematics (2008)

- Volume: 16, Issue: 1, page 29-33
- ISSN: 1426-2630

## Access Full Article

top## Abstract

top## How to cite

topMichał Trybulec. " Regular Expression Quantifiers - at least m Occurrences ." Formalized Mathematics 16.1 (2008): 29-33. <http://eudml.org/doc/266905>.

@article{MichałTrybulec2008,

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},

author = {Michał Trybulec},

journal = {Formalized Mathematics},

language = {eng},

number = {1},

pages = {29-33},

title = { Regular Expression Quantifiers - at least m Occurrences },

url = {http://eudml.org/doc/266905},

volume = {16},

year = {2008},

}

TY - JOUR

AU - Michał Trybulec

TI - Regular Expression Quantifiers - at least m Occurrences

JO - Formalized Mathematics

PY - 2008

VL - 16

IS - 1

SP - 29

EP - 33

AB - 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

LA - eng

UR - http://eudml.org/doc/266905

ER -

## References

top- [1] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990. Zbl06213858
- [2] Karol Pąk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153-159, 2006.
- [3] Michał Trybulec. Formal languages - concatenation and closure. Formalized Mathematics, 15(1):11-15, 2007.
- [4] Michał Trybulec. Regular expression quantifiers - m to n occurrences. Formalized Mathematics, 15(2):53-58, 2007.
- [5] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
- [6] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.
- [7] William M. Waite and Gerhard Goos. Compiler Construction. Springer-Verlag New York Inc., 1984. Zbl0527.68003
- [8] Larry Wall, Tom Christiansen, and Jon Orwant. Programming Perl, Third Edition. O'Reilly Media, 2000. Zbl0949.68015

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.