Skip to main content
Have a personal or library account? Click to login
Regular Expression Quantifiers — m to n Occurrences Cover

Regular Expression Quantifiers — m to n Occurrences

Open Access
|Jun 2008

References

  1. [7] Andrzej Trybulec. Subsets of complex numbers.
  2. [8] Andrzej Trybulec. Domains and their Cartesian products., 1(1):115-122, 1990.
  3. [9] Andrzej Trybulec. Tarski Grothendieck set theory., 1(1):9-11, 1990.
  4. [10] Michał Trybulec. Formal languages - concatenation and closure., 15(1):11-15, 2007.
  5. [11] Zinaida Trybulec. Properties of subsets., 1(1):67-71, 1990.
  6. [12] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences., 9(4):825-829, 2001.
  7. [13] Larry Wall, Tom Christiansen, and Jon Orwant.O'Reilly Media, 2000.
  8. [14] Edmund Woronowicz. Relations defined on sets., 1(1):181-186, 1990.
  9. [1] Grzegorz Bancerek. The ordinal numbers., 1(1):91-96, 1990.
  10. [2] Czesław Byliński. Functions and their basic properties., 1(1):55-65, 1990.
  11. [3] Czesław Byliński. Functions from a set to a set., 1(1):153-164, 1990.
  12. [4] Czesław Byliński. Some basic properties of sets., 1(1):47-53, 1990.
  13. [5] Beata Padlewska. Families of sets., 1(1):147-152, 1990.
  14. [6] Karol Pαk. The Catalan numbers. Part II., 14(4):153-159, 2006.
DOI: https://doi.org/10.2478/v10037-007-0006-7 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Language: English
Page range: 53 - 58
Published on: Jun 9, 2008
Published by: University of Białystok
In partnership with: Paradigm Publishing Services

© 2008 Michał Trybulec, published by University of Białystok
This work is licensed under the Creative Commons License.