Algebraic languages and polyominoes enumeration
From MaRDI portal
Publication:1348529
DOI10.1016/0304-3975(84)90116-6zbMath0985.68516OpenAlexW1980486012MaRDI QIDQ1348529
Xavier G. Viennot, Delest, Marie-Pierre
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
Combinatorics in computer science (68R05) Grammars and rewriting systems (68Q42) Polyominoes (05B50)
Related Items (only showing first 100 items - show all)
Geometric properties of matrices induced by pattern avoidance ⋮ A consecutive Lehmer code for parabolic quotients of the symmetric group ⋮ The degree of symmetry of lattice paths ⋮ Irregular polyomino tiling via integer programming with application in phased array antenna design ⋮ Counting pairs of noncrossing binary paths: a bijective approach ⋮ Watermelon uniform random generation with applications ⋮ Combinatorial aspects of \(L\)-convex polyominoes ⋮ The generating function of convex polyominoes: The resolution of a \(q\)- differential system ⋮ Two combinatorial statistics on Dyck paths ⋮ The Narayana distribution ⋮ A bijective proof of a Touchard-Riordan formula ⋮ ``Deco polyominoes, permutations and random generation ⋮ Enumeration of polyominoes using Macsyma ⋮ Enumeriation of parallelogram polyominoes with given bond and site perimeter ⋮ A decomposition of column-convex polyominoes and two vertex statistics ⋮ Nondecreasing Dyck paths and \(q\)-Fibonacci numbers ⋮ Smooth column convex polyominoes ⋮ On the enumeration of \(k\)-omino towers ⋮ Asymptotic enumeration of convex polygons ⋮ 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 ⋮ Area of Catalan paths on a checkerboard ⋮ Enumeration of various animals on the triangular lattice ⋮ A new way of counting the column-convex polyominoes by perimeter ⋮ Self-avoiding walks, the language of science, and Fibonacci numbers ⋮ Enumeration of the directed convex polyominoes ⋮ Enumeration of 4-stack polyominoes ⋮ Solving multivariate functional equations ⋮ Counting \(k\)-convex polyominoes ⋮ Combinatorics of non-ambiguous trees ⋮ From Tetris to polyominoes generation ⋮ Periodic parallelogram polyominoes ⋮ Object grammars and bijections. ⋮ Enumeration via ballot numbers ⋮ Statistics on parallelogram polyominoes and a \(q,t\)-analogue of the Narayana numbers ⋮ Counting problems and algebraic formal power series in noncommuting variables ⋮ The enumeration of prudent polygons by area and its unusual asymptotics ⋮ Lattice path matroids: Enumerative aspects and Tutte polynomials ⋮ Saturated fully leafed tree-like polyforms and polycubes ⋮ On the area of square lattice polygons. ⋮ Automatic average-case analysis of algorithms ⋮ On the tiling system recognizability of various classes of convex polyominoes ⋮ The complexity of computing the number of strings of given length in context-free languages ⋮ On computing the degree of convexity of polyominoes ⋮ Partially directed animals with a bounded number of holes ⋮ Random generation of words in an algebraic language in linear binary space ⋮ The number of convex permutominoes ⋮ Identities from weighted Motzkin paths ⋮ 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 ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Identities involving weighted Catalan, Schröder and Motzkin paths ⋮ On the exhaustive generation of \(k\)-convex polyominoes ⋮ The number of Z-convex polyominoes ⋮ Identities in search of identity ⋮ Context-free grammars, differential operators and formal power series ⋮ On an involution on the Dyck paths ⋮ Enumeration of Hamiltonian cycles in a squared rectangle ⋮ An involution on the Dyck paths ⋮ Narayana number, Chebyshev polynomial and Motzkin path on RNA abstract shapes ⋮ On the generation of convex polyominoes ⋮ Families of \(m\)-convex polygons: \(m=1\) ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ The average height of directed column-convex polyominoes having square, hexagonal and triangular cells ⋮ The number of three-choice polygons ⋮ 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 ⋮ Combinatorics of labelled parallelogram polyominoes ⋮ A bijection for the total area of parallelogram polyominoes ⋮ Skew Dyck paths ⋮ The number of convex polyominoes and the generating function of Jacobi polynomials ⋮ The perimeter of words ⋮ Noncrossing normal ordering for functions of boson operators ⋮ Symmetric peaks and symmetric valleys in Dyck paths ⋮ Critical exponents from nonlinear functional equations for partially directed cluster models ⋮ Stacking models of vesicles and compact clusters ⋮ The number of directed \(k\)-convex polyominoes ⋮ Parallelogram polyominos with border and Bessel functions ⋮ Generating functions for column-convex polyominoes ⋮ Enumeration of symmetry classes of convex polyominoes in the square lattice ⋮ The number of convex polyominoes with given perimeter ⋮ On column-convex and convex Carlitz polyominoes ⋮ Strip tiling and regular grammars ⋮ Maximal superpositions of horizontally convex polyominoes ⋮ Limits of areas under lattice paths ⋮ Pairs of noncrossing free Dyck paths and noncrossing partitions ⋮ Enumeration of three-dimensional convex polygons ⋮ Random walks in octants, and related structures ⋮ Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions ⋮ Dyck path enumeration ⋮ Constraint-sensitive Catalan path statistics having the Narayana distribution ⋮ Enumeration of L-convex polyominoes by rows and columns ⋮ Adsorbing staircase walks and staircase polygons ⋮ Coding the convex polyominoes and equations for the enumeration according to the area ⋮ Basic analytic combinatorics of directed lattice paths ⋮ A strip-like tiling algorithm ⋮ \(q\)-enumeration of convex polyominoes ⋮ Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Remarks on multihead pushdown automata and multihead stack automata
- Binomial determinants, paths, and hook length formulae
- Shuffle of parenthesis systems and Baxter permutations
- Cônes rationnels commutatifs
- Combinatorial properties of polyominoes
- Langages algébriques, paires iterantes et transductions rationnelles
- Formal languages and enumeration
- Generating functions for column-convex polyominoes
- A Markov chain occurring in enzyme kinetics
- Convex n-ominoes
- Asymptotic bounds for the number of convex \(n\)-ominoes
- A contect-free language and enumeration problems on infinite trees and digraphs
- Planar Maps are Well Labeled Trees
- Contributions to the Cell Growth Problem
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- On the number of certain lattice polygons
- k + 1 Heads Are Better than k
- Covering Regions by Rectangles
- Tiling with polyominoes
- On Multi-Head Finite Automata
- Cell Growth Problems
- A helpful result for proving inherent ambiguity
- STACKS
- A Census of Planar Maps
- On context-free languages and push-down automata
This page was built for publication: Algebraic languages and polyominoes enumeration