Regular Expression Quantifiers - at leastmOccurrences

• Autorzy: Michał Trybulec
• Języki publikacji: EN

Abstrakty

EN

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

• Wydawca: De Gruyter Open
• Czasopismo: Formalized Mathematics
• Rocznik: 2008
• Tom: 16
• Numer: 1
• Strony: 29-33

Daty

wydano

2008-01-01

online

2009-03-20

Twórcy

autor

Michał Trybulec

• Motorola Software Group, Cracow, Poland

Bibliografia

• [1] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
• [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.
• [8] Larry Wall, Tom Christiansen, and Jon Orwant. Programming Perl, Third Edition. O'Reilly Media, 2000.

Identyfikatory

DOI

10.2478/v10037-008-0005-3