Regular Expression Quantifiers — m to n Occurrences

[7] Andrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics.Search in Google Scholar

[8] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.Search in Google Scholar

[9] Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9-11, 1990.Search in Google Scholar

[10] Michał Trybulec. Formal languages - concatenation and closure. Formalized Mathematics, 15(1):11-15, 2007.10.2478/v10037-007-0002-ySearch in Google Scholar

[11] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Search in Google Scholar

[12] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.Search in Google Scholar

[13] Larry Wall, Tom Christiansen, and Jon Orwant. Programming Perl, Third Edition. O'Reilly Media, 2000.Search in Google Scholar

[14] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.Search in Google Scholar

[1] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Search in Google Scholar

[2] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Search in Google Scholar

[3] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Search in Google Scholar

[4] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Search in Google Scholar

[5] Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.Search in Google Scholar

[6] Karol Pαk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153-159, 2006.10.2478/v10037-006-0019-7Search in Google Scholar