Algebraic languages and polyominoes enumeration
From MaRDI portal
Publication:1348529
DOI10.1016/0304-3975(84)90116-6zbMath0985.68516MaRDI QIDQ1348529
Delest, Marie-Pierre, Xavier G. Viennot
Publication date: 13 May 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90116-6
Related Items
Succession rules and Deco polyominoes, Automated counting of lego towers, ECO:a methodology for the enumeration of combinatorial objects, Baxter permutations, Enumeration of skew Ferrers diagrams, Random generation of words in an algebraic language in linear binary space, Identities in search of identity, Context-free grammars, differential operators and formal power series, On an involution on the Dyck paths, Automatic average-case analysis of algorithms, The complexity of computing the number of strings of given length in context-free languages, Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes), Attribute grammars are useful for combinatorics, Enumeration of Hamiltonian cycles in a squared rectangle, An involution on the Dyck paths, Enumeration of skew Ferrers diagrams and basic Bessel functions, On pairs of non-crossing generalized Dyck paths, A symmetric variation of a distribution of Kreweras and Poupard, Enumeration of symmetry classes of convex polyominoes in the square lattice, Maximal superpositions of horizontally convex polyominoes, Enumeration of three-dimensional convex polygons, Dyck path enumeration, Constraint-sensitive Catalan path statistics having the Narayana distribution, Adsorbing staircase walks and staircase polygons, Coding the convex polyominoes and equations for the enumeration according to the area, \(q\)-enumeration of convex polyominoes, The generating function of convex polyominoes: The resolution of a \(q\)- differential system, Two combinatorial statistics on Dyck paths, ``Deco polyominoes, permutations and random generation, Nondecreasing Dyck paths and \(q\)-Fibonacci numbers, Asymptotic enumeration of convex polygons, A new way of counting the column-convex polyominoes by perimeter, Strip tiling and regular grammars, Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions, Parallelogram polyominos with border and Bessel functions, Generating functions for column-convex polyominoes, A bijective proof of a Touchard-Riordan formula, Generating convex polyominoes at random, Combinatorial theory of \(\text{T}\)-fractions and two points Padé approximants, A method for the enumeration of various classes of column-convex polygons, Self-avoiding walks, the language of science, and Fibonacci numbers, Enumeration of the directed convex polyominoes, On the area of square lattice polygons., Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley, Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
