Animaux et arbres guingois. (Animals and guingois trees)

DOI10.1016/0304-3975(93)90304-CzbMath0780.68098OpenAlexW53775812MaRDI QIDQ688682

Jean Bétréma, Jean-Guy Penaud

Publication date: 15 December 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90304-c

zbMATH Keywords

directed animalstreescoding

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Polyominoes (05B50)

Related Items

The random generation of directed animals, Probabilistic analysis of some (un)directed animals, New enumerative results on two-dimensional directed animals, Bijections between directed animals, multisets and Grand-Dyck paths, The design of efficient dynamic programming and transfer matrix enumeration algorithms, Animaux et arbres guingois. (Animals and guingois trees), A note on the enumeration of directed animals via gas considerations, Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite, Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\), Directed animals, forests and permutations

Cites Work

• Animaux et arbres guingois. (Animals and guingois trees)
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• The free partially commutative Lie algebra: Bases and ranks
• Restoration of universality for the rod-to-coil transition scaling in the infinite-dimensionality limit: exact results for directed walks.
• Combinatorial problems of commutation and rearrangements
• Uniform Random Generation of Strings in a Context-Free Language
• On context-free languages and push-down automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item