On the average depth of a prefix of the Dycklanguage D_ 1.

zbMATH Open0468.68074MaRDI QIDQ1156490FDOQ1156490

Authors: S. H. Smith 

Publication date: 1981

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

zbMATH Keywords

asymptotic expansionsgenerating functionsaverage depthDyck language

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The average height of r-tuply rooted planted plane trees
• Title not available (Why is that?)
• The average number of registers needed to evaluate a binary tree optimally
• Title not available (Why is that?)
• A note on the stack size of regularly distributed binary trees
• Title not available (Why is that?)

Cited In (7)

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

This page was built for publication: On the average depth of a prefix of the Dycklanguage \(D_ 1\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156490)