A Note on Generating Well-formed Parenthesis Strings Lexicographically

DOI10.1093/COMJNL/26.3.205zbMATH Open0521.68082OpenAlexW2171997032MaRDI QIDQ3670599FDOQ3670599

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

recursive algorithmbinary treeordered treesstack-sortable permutationswell-formed parenthesis strings

Mathematics Subject Classification ID

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

Cited In (4)

• A note on generating binary trees inA-order andB-order
• Ranking and Unranking of Non-regular Trees
• Two shortest path metrics on well-formed parentheses strings
• 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)