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
@article{bwmeta1.element.doi-10_2478_v10037-008-0005-3,
author = {Micha\l\ Trybulec},
title = {
Regular Expression Quantifiers - at least
m
Occurrences
},
journal = {Formalized Mathematics},
volume = {16},
year = {2008},
pages = {29-33},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_2478_v10037-008-0005-3}
}
Michał Trybulec.
Regular Expression Quantifiers - at least
m
Occurrences
. Formalized Mathematics, Tome 16 (2008) pp. 29-33. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_2478_v10037-008-0005-3/
[1] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990. | Zbl 06213858
[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. | Zbl 0527.68003
[8] Larry Wall, Tom Christiansen, and Jon Orwant. Programming Perl, Third Edition. O'Reilly Media, 2000. | Zbl 0949.68015