Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1983: Automata, Languages and Programming pp 173–181Cite as

Algebraic languages and polyomnoes enumeration

  • Conference paper
  • First Online:

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

Abstract

The purpose of this paper is to show the use of algebraic languages theory in solving an open problem in combinatorics : give a formula for the number of convex polyominoes.

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. E. BENDER: Convex n-ominoes Discrete Maths, 8 (1974) 31–40.

    Google Scholar 

  2. BLATTNER, M. LATTEUX: Parikh-bounded languages, in Proc. 8th ICALP, Lecture Note in Computer Science nℴ115, Springer (1981) 316–323.

    Google Scholar 

  3. L. BOASSON: Langages algébriques, paires itérantes et transductions rationnelles, Theor. Comp. Sci. 2 (1976) 209–223.

    Google Scholar 

  4. R. CORI: “Un code pour les graphes planaires et ses applications”, Astérisque, Société Mathématique de France 27 (1975).

    Google Scholar 

  5. R. CORI, B. VAUQUELIN: Planar maps are well labeled trees, Can. Jour. Math., 33(1961) 1023–1042.

    Google Scholar 

  6. I. GESSEL: A noncommutative generalization and q-analog of the Lagrange inversion formula, Trans. Amer. Math. Soc., 257 (1980) 455–482.

    Google Scholar 

  7. J. GOLDMAN: Formal languages and enumeration. Jour. of Comb. Th., (A) 24 (1978) 318–338.

    Google Scholar 

  8. S. GOLOMB: “Polyominoes”, Scribner's, New-York, (1965).

    Google Scholar 

  9. D. KLARNER, R. RIVEST: Asymptotic bounds for the number of convex n-ominoes, Discrete Maths, 8 (1974) 31–40.

    Google Scholar 

  10. M. LATTEUX: Cones rationnels commutatifs, J.C.S.S., 18 (1979) 307–333.

    Google Scholar 

  11. W. OGDEN: A helpful result for proving inherent ambiguity, Math. Syst. The., 2 (1968) 191–194.

    Google Scholar 

  12. G. POLYA: On the number of certain lattice polygons, J. of Comb. Th. 6 (1969) 102–105.

    Google Scholar 

  13. A. SALOMAA, M. SOITTOLA: “Automa-Theoretic aspects of formal power series”, Springer Verlag, (1978).

    Google Scholar 

  14. W. T. TUTTE: A census of planar maps, Can. Jour. Math., 15 (1963) 249–271.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Bordeaux II, 33076, Bordeaux Cedex, France

    M. P. Delest

  2. Université Bordeaux I, 33405, Talence, France

    G. Viennot

Authors
  1. M. P. Delest
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Viennot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delest, M.P., Viennot, G. (1983). Algebraic languages and polyomnoes enumeration. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036907

Download citation

  • DOI: https://doi.org/10.1007/BFb0036907

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation