Have a personal or library account? Click to login
String Rewriting Systems Cover

String Rewriting Systems

Formalized Mathematics
Volume 15 (2007): Issue 3 (September 2007)
By: Michał Trybulec  
Open Access
|Jun 2008

References

  1. [1] Grzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469-478, 1996.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.
    Search in Google Scholar
  3. [3] Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.
    Search in Google Scholar
  4. [4] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.
    Search in Google Scholar
  5. [5] Patricia L. Carlson and Grzegorz Bancerek. Context-free grammar - part 1. Formalized Mathematics, 2(5):683-687, 1991.
    Search in Google Scholar
  6. [6] Markus Moschner. Basic notions and properties of orthoposets. Formalized Mathematics, 11(2):201-210, 2003.
    Search in Google Scholar
  7. [7] 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
  8. [8] Andrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics.
    Search in Google Scholar
  9. [9] Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990.
    Search in Google Scholar
  10. [10] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.
    Search in Google Scholar
  11. [11] Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9-11, 1990.
    Search in Google Scholar
  12. [12] Michał Trybulec. Formal languages - concatenation and closure. Formalized Mathematics, 15(1):11-15, 2007.10.2478/v10037-007-0002-y
    Search in Google Scholar
  13. [13] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
    Search in Google Scholar
  14. [14] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.
    Search in Google Scholar
  15. [15] 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
  16. [16] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.
    Search in Google Scholar
  17. [17] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.
    Search in Google Scholar
  18. [18] Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10037-007-0013-8 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 121 - 126
Published on: Jun 9, 2008
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
Computer sciences,
Computer sciences, other,
Mathematics,
General mathematics

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

Volume 15 (2007): Issue 3 (September 2007)