On the average depth of a prefix of the Dycklanguage \(D_ 1\).

zbMath0468.68074MaRDI QIDQ1156490

S. H. Smith

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionsasymptotic expansionsaverage depthDyck language

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence (68T99)

Related Items

Truncations of infinite matrices and algebraic series associated with some CF grammars, The scientific works of Rainer Kemp (1949--2004), Unnamed Item, On the number of deepest nodes in ordered trees, Two-sided prudent walks: a solvable non-directed model of polymer adsorption, On some problems about ternary paths: a linear algebra approach, The average height of planted plane trees with M leaves

Cites Work

• The average height of r-tuply rooted planted plane trees
• The average number of registers needed to evaluate a binary tree optimally
• A note on the stack size of regularly distributed binary trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item