Regular Expression Quantifiers - at least m Occurrences

Michał Trybulec

doi:10.2478/v10037-008-0005-3

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

References

[1] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
Search in Google Scholar
[2] Karol Pąk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153-159, 2006.10.2478/v10037-006-0019-7
Search in Google Scholar
[3] Michał Trybulec. Formal languages - concatenation and closure. Formalized Mathematics, 15(1):11-15, 2007.10.2478/v10037-007-0002-y
Search in Google Scholar
[4] Michał Trybulec. Regular expression quantifiers - m to n occurrences. Formalized Mathematics, 15(2):53-58, 2007.10.2478/v10037-007-0006-7
Search in Google Scholar
[5] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
Search in Google Scholar
[6] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.
Search in Google Scholar
[7] William M. Waite and Gerhard Goos. Compiler Construction. Springer-Verlag New York Inc., 1984.10.1007/978-1-4612-5192-7
Search in Google Scholar
[8] Larry Wall, Tom Christiansen, and Jon Orwant. Programming Perl, Third Edition. O'Reilly Media, 2000.
Search in Google Scholar

Regular Expression Quantifiers - at least m Occurrences

Abstract

Paradigm

My account