On the reconstruction of a Motzkin Tree from its code

DOI10.1080/02522667.2003.10699586zbMATH Open1100.68594OpenAlexW1988691323MaRDI QIDQ4469167FDOQ4469167

Vincent Vajnovszki, Ronny Pattisina

Publication date: 14 June 2004

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2003.10699586

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• Uniform generation of a Motzkin word
• Some more properties of Catalan numbers
• Gray visiting Motzkins
• Trees associated with the Motzkin numbers

Cited In (1)

• Tree-Based Encoding for Cancellations on Morse Complexes

   Recommendations

• Efficient algorithms for tree reconstruction 👍 👎
• Linear time tree codes 👍 👎
• Grammatical codes of trees 👍 👎
• A New Coding Algorithm for Trees 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On the reconstruction of a Motzkin Tree from its code

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