Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1994: STACS 94 pp 377–388Cite as

Q-grammars: Results, implementation

  • Conference paper
  • First Online:

  • 125 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 775))

Abstract

This paper deals with an extension of the Schützenberger's methodology in which algebraic grammars are used in order to enumerate combinatorial objects. The extension allows us to make computation with q-series. We present here some results and a computer algebra system QGRAM for the resolution of such equations.

With the support of the PRC Mathématiques et Informatique.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.E. ANDREWS, q-series: their development and applications in analysis, number theory, combinatorics, physics and computer algebra, AMS library of congress, Cataloging in publication data (1986).

    Google Scholar 

  2. F. BERGERON, G. CARTIER, DARWIN: Computer Algebra and Enumerative combinatorics, Proc. STACS 88, Eds. R. Cori et M. Wirsing, Springer Lectures Notes in Computer Science, 294 (1988), 393–394.

    Google Scholar 

  3. M. BOUSQUET-MELOU, q-énumération de polyominos convexes, Thèse de l'Université de Bordeaux 1, (1991).

    Google Scholar 

  4. M. DELEST, J.M. FEDOU, Attribute grammars are useful for combinatorics, Theor. Comp. Sci. 98, (1992) 65–76.

    Google Scholar 

  5. M. DELEST, J.M. FEDOU, Enumeration of skew Ferrers diagrams, Discrete Maths (to appear).

    Google Scholar 

  6. J.P. DUBERNARD, q-grammaires et polyominos parrallélogrammes, Thèse Université Bordeaux I, 1993.

    Google Scholar 

  7. F. ENGELFRIED, G. FILE, Formal power of attribute grammars, Acta Informatica 16 (1981) 275–302.

    Google Scholar 

  8. K.O. GEDDES, G.H. GONNET, B.W. CHAR, Maple, User's Manual, Research report CS-83-41, University of Waterloo, 1983.

    Google Scholar 

  9. D. PERRIN, Words of partially commutative alphabet, Eds. A. Apostolico, Z. Galil, Combinatorial algorithm on words, NATO ASI-series, F12 (1985), 329–340.

    Google Scholar 

  10. M.P. SCHUTZENBERGER, Certain elementary families of automata, in Proc. Symp. on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962, 139–153.

    Google Scholar 

  11. SYMBOLICS INC., Macsyma reference manual, version 10, 3rd edition, 1984.

    Google Scholar 

  12. X. VIENNOT, A survey of polyominoes enumeration, Proceedings of FPSAC92, Montréal, Eds. P. Leroux, C. Reutenauer (1992), 399–420.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université Bordeaux I, 351 Cours de la Libération, 33405, Talence cedex, France

    Maylis Delest

  2. LIUP, Université de Poitiers, 40 Avenue du Recteur Pinaud, 86022, Poitiers cedex, France

    Jean-Philippe Dubernard

Authors
  1. Maylis Delest
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Philippe Dubernard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delest, M., Dubernard, JP. (1994). Q-grammars: Results, implementation. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_156

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_156

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation