Free Access
Issue
R.A.I.R.O. Informatique théorique
Volume 9, Number R3, 1975
Page(s) 13 - 24
DOI https://doi.org/10.1051/ita/197509R300131
Published online 01 February 2017
  1. BERGE (C.), Principes de combinatoire. Dunod, Paris, 1968. [Zbl: 0227.05001] [Google Scholar]
  2. BERGE (C.), Graphes et hypergraphes. Dunod, Paris, 1970. [Zbl: 0213.25702] [Google Scholar]
  3. BERTRAND, Solution d'un problème. C. R. Acad. Sci. Paris, 105 (1887), 369. [Google Scholar]
  4. CATALAN (E.), Note sur une équation aux différences finies. J. Math. Pures Appl., 3 (1838), 508-516. [EuDML: 233904] [Google Scholar]
  5. COMTET, Analyse combinatoire. P.U.F. Paris (1970). [Zbl: 0221.05002] [Google Scholar]
  6. CORI (R.), Some applications of formal langages to enumerations problems. Tagung über Formale Sprachen. Oberwolfach 1970. Mitteilungen der Gesellschaft fur Mathematik und Datenverarbeitung, 8 (1970), 10-12. [Zbl: 0223.02047] [Google Scholar]
  7. CORI (R.), Un code pour les graphes planaires et ses applications. Thèse de Doctorat d'État, Paris 1973. [Google Scholar]
  8. EULER (L.), Novi Comentarii Academiae Scientarium Imperialis Petropolitanae, 7 (1758-1759), 13-14. [Google Scholar]
  9. FOATA (D.), SCHUTZENBERGER (M. P.), Théorie géométrique des polynômes eulériens. Lectures Notes in Mathematics n° 138. Springer-Verlag Berlin 1970. [Zbl: 0214.26202] [Google Scholar]
  10. GOODMAN-NARAYANA, Lattice paths with diagonal steps. Publication University Alberta, 39 (1967). [Zbl: 0211.49503] [Google Scholar]
  11. GROSS (M.), Applications géométriques des langages formels. I. C. C. Bull., 5 (1966), 141-168. [Google Scholar]
  12. HALL (M.), Combinatorial Theory. Blaisdell Publishing Company, Toronto, 1967. [Zbl: 0196.02401] [Google Scholar]
  13. HARARY (F.), PRINS (G.), TUTTE (W.T.), The number of plane trees. Indag Math., 26 (1964), 319-329. [Zbl: 0126.19002] [Google Scholar]
  14. JACKSON (E.), ENTRINGER (R. C.), Enumeration of certain binary matrices. J. Comb. Theory, 8 (1970), 291-298. [Zbl: 0192.33403] [Google Scholar]
  15. KLARNER, Correspondance between plane trees and binary sequences. J. Comb. Theory, 9 (1970), 401-411. [Zbl: 0205.54702] [Google Scholar]
  16. KREWERAS, Dénombrement des chemins minimaux à sauts imposés. C. R. Acad. Sci. Paris, 263 (1966), 1-3. [Zbl: 0304.05016] [Google Scholar]
  17. KUICH (W.), Enumeration problems and context free languages. Combinatorial Theory and its applications. Balaton-Füred (Erdos, Renyi, T. Sös éd.), North Holland Amsterdam-Londres, 1970, 729-735. [Zbl: 0228.68022] [Google Scholar]
  18. NARAYANA (T. V.), A partial order and its applications to probability Theory. Sankhya, 21 (1959), 91-98. [Zbl: 0168.39202] [Google Scholar]
  19. NARAYANA (T. V.), SATHE (Y. S.) and CHORNEYKO (I.), Sufficient partition for a class of coin-tossing problems. Biometrische Zeitschrift, 4 (1960), 269-275. [Zbl: 0096.12701] [Google Scholar]
  20. RANEY (G.), Functional composition patterns and power series reversion. Trans. Amer. Math. Soc., 94 (1960, 441-451. [Zbl: 0131.01402] [Google Scholar]
  21. RODRIGUES (O.), Sur le nombre de manières d'effectuer un produit de n facteurs. J. Math. Pures et Appl., 3 (1838), 549. [EuDML: 234461] [Google Scholar]
  22. SCHUTZENBERGER (M. P.), Le théorème de Lagrange selon Raney. In Séminaires I.R.I.A., Logique et automates, Rocquencourt (1971), 270-275. [Zbl: 0363.05016] [Google Scholar]
  23. SEGNER (J. A.), Enumeralis modorum, quibus figurae planae rectilinae per diagonales dividantur in triangula. Novi Comentarii Academiae Scientarium Imperialis Petropolitanae, 7 (1758-1759), 203-209. [Google Scholar]
  24. WHITTAKER, WATSON (G. N.), A cours of modem analysis. Cambridge University Press, Cambridge 1940. [Zbl: 0951.30002] [JFM: 45.0433.02] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.