A Note on Generating Well-formed Parenthesis Strings Lexicographically

DOI10.1093/COMJNL/26.3.205MaRDI QIDQ3670599zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1983

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/26.3.205

zbMATH Keywords

binary treeordered treesrecursive algorithmstack-sortable permutationswell-formed parenthesis strings

Mathematics Subject Classification ID

Trees (05C05) Discrete mathematics in relation to computer science (68R99)

Cited in

(4)

• Two shortest path metrics on well-formed parentheses strings
• Ranking and Unranking of Non-regular Trees
• A note on generating binary trees inA-order andB-order
• On enumerating tree permutations in natural order

This page was built for publication: A Note on Generating Well-formed Parenthesis Strings Lexicographically

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