On the reconstruction of a Motzkin Tree from its code

DOI10.1080/02522667.2003.10699586MaRDI QIDQ4469167zbMATH OpenOpenAlexFDO

Authors Ronny Pattisina, Vincent Vajnovszki

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)

Recommendations

• Efficient algorithms for tree reconstruction
• Linear time tree codes
• Grammatical codes of trees
• A New Coding Algorithm for Trees
• scientific article; zbMATH DE number 568780

Cites work

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

Cited in

(1)

• Tree-Based Encoding for Cancellations on Morse Complexes

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)