Skip to main content
Have a personal or library account? Click to login
Regular Expression Quantifiers - at least m Occurrences Cover

Regular Expression Quantifiers - at least m Occurrences

Formalized Mathematics
Volume 16 (2008): Issue 1 (March 2008)
By:   
Open Access
|Mar 2009
References

References

  1. [1] Grzegorz Bancerek. The fundamental properties of natural numbers., 1(1):41-46, 1990.
    Search in Google Scholar
  2. [2] Karol Pąk. The Catalan numbers. Part II., 14(4):153-159, 2006.
    Open DOISearch in Google Scholar
  3. [3] Michał Trybulec. Formal languages - concatenation and closure., 15(1):11-15, 2007.
    Open DOISearch in Google Scholar
  4. [4] Michał Trybulec. Regular expression quantifiers -tooccurrences., 15(2):53-58, 2007.
    Open DOISearch in Google Scholar
  5. [5] Zinaida Trybulec. Properties of subsets., 1(1):67-71, 1990.
    Search in Google Scholar
  6. [6] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences., 9(4):825-829, 2001.
    Search in Google Scholar
  7. [7] William M. Waite and Gerhard Goos.Springer-Verlag New York Inc., 1984.
    Open DOISearch in Google Scholar
  8. [8] Larry Wall, Tom Christiansen, and Jon Orwant.O'Reilly Media, 2000.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-008-0005-3 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 29 - 33
Published on: Mar 20, 2009
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

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

Volume 16 (2008): Issue 1 (March 2008)
Previous article
Next article